Johny Likes Numbers

Time Limit: 0.5 seconds

Memory Limit: 256 megabytes

Description

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.

Input

The only line contains two integers n and k (1 ≤ n, k ≤ 109).

Output

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

Sample Input

Input
5 3
Output
6
Input
25 13
Output
26
Input
26 13
Output
39

Sample Output

None

Hint

None

Source

None

提交代码