Johny Likes Numbers

Jonhy非常喜欢数N和K，现在Johny要找一个可以整除K的最小整数x，且满足x>n。

Johny likes numbers $ n $ and $ k $ very much. Now Johny wants to find the smallest integer $ x $ greater than $ n $ , so it is divisible by the number $ k $ .

The only line contains two integers $ n $ and $ k $ ( $ 1<=n,k<=10^{9} $ ).

Print the smallest integer $ x>n $ , so it is divisible by the number $ k $ .

5 3

6

25 13

26

26 13

39