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.

Input

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

Output

Print the k-rounding of n.

Examples

Input

375 4


Output

30000


Input

10000 1


Output

10000


Input

38101 0


Output

38101


Input

123456789 8


Output

12345678900000000
n, k = [int(i) for i in input().split()]
def primfacs(n):
   i = 2
   primfac = []
   while i * i <= n:
       while n % i == 0:
           primfac.append(i)
           n = n / i
       i = i + 1
   if n > 1:
       primfac.append(n)
   return primfac
a = primfacs(n)
b = []
for i in range(k):
    b.append(2)
    b.append(5)
for i in range(len(a)):
    c = a[i]
    if a[i] in b:
        a[i] = 1
        b[b.index(c)] = 1
z = 1
for i in range(len(a)):
    if a[i] != 1:
        z *= a[i]
print(int(z * (10 ** k)))
        
