Educational Codeforces Round 13 A

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.

Examples

input

5 3

output

6

input

25 13

output

26

input

26 13

output

39
嗯，这个就没必要说了吧，找n与k的关系

 #include<iostream>
 #include<stdio.h>
 #include<algorithm>
 #include<string.h>
 using namespace std;
 int a,b,c;
 long long n,t;
 int main()
 {
     long long k;
     long long sum;
     cin>>n>>k;
     cout<<(n/k+)*k<<endl;
     return ;
 }