1. 题库
  2. 提交

655. Johny Likes Numbers

time limit per test
0.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

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

难度等级： 1
总通过次数： 1
总提交次数： 2
  • implementation
ACM/ICPC