No tag edit access

A. Johny Likes Numbers

time limit per test

0.5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputJohny 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* ≤ 10^{9}).

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

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/22/2018 20:00:01 (d2).

Desktop version, switch to mobile version.

User lists

Name |
---|