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 $ .
输入输出样例
输入样例 #1
5 3
输出样例 #1
6
输入样例 #2
25 13
输出样例 #2
26
输入样例 #3
26 13
输出样例 #3
39