Problem Description

Yazuka is participating in an auction. The item he wants currently has a price of $ X $ yen.

Yazuka can bid a price $ Y $ that satisfies the following conditions:

• The bid is appropriate for the auction, meaning $X+1 \leq Y$.
• The amount is not too granular, meaning the last $ K $ digits in the decimal representation of $ Y $ are all zeros.

Find the minimum amount Yazuka can bid.

Input Format

The input is given from the standard input in the following format:

$ X $ $ K $

Output Format

Output the minimum amount Yazuka can bid.

Sample Input and Output

Sample Input #1

2018 2

Sample Output #1

2100

Sample Input #2

888 0

Sample Output #2

889

Sample Input #3

100 7

Sample Output #3

10000000

Notes/Hints

Constraints

• $1 \leq X \leq 10^9$
• $0 \leq K \leq 9$
• All inputs are integers.

Sample Explanation 1

The smallest amount greater than $ 2018 $ yen with the last $ 2 $ digits being zeros is $ 2100 $ yen.

Sample Explanation 2

Note that you must bid an amount greater than $ X $ yen.

见题面 Input 部分

见题面 Output 部分