Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
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-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/23/2021 09:50:03 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|