#P858A. k-rounding

    ID: 4786 远端评测题 1000ms 256MiB 尝试: 0 已通过: 0 普及/提高- 上传者: 标签>brute forcemathnumber theory*1100

k-rounding

Description

For a given positive integer n denote its k-rounding as the minimum positive integer x, such that x ends with k or more zeros in base 10 and is divisible by n.

For example, 4-rounding of 375 is 375·80 = 30000. 30000 is the minimum integer such that it ends with 4 or more zeros and is divisible by 375.

Write a program that will perform the k-rounding of n.

The only line contains two integers n and k (1 ≤ n ≤ 109, 0 ≤ k ≤ 8).

Print the k-rounding of n.

Input

The only line contains two integers n and k (1 ≤ n ≤ 109, 0 ≤ k ≤ 8).

Output

Print the k-rounding of n.

375 4

10000 1

38101 0

123456789 8

30000

10000

38101

12345678900000000