CF678A Johny Likes Numbers

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 $ .

The only line contains two integers $ n $ and $ k $ ( $ 1

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