CF678A.Johny Likes Numbers

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

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$ .