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 = map(int,input().split())
ii= 0
jj = 0
while n % (5**jj) == 0:
    jj+= 1
ll = 0
while n % (2**ll) == 0:
    ll+= 1
ll -= 1
jj-=1

ii += min(jj,ll)
if jj>ll:
    jj -= ll
    ll = 0

else:
    ll -= jj
    jj = 0
    
if k <= ii:
    print(n)
    quit()
k -= ii
if ll == 0:
    if jj >= k:
        print(n * (2**k))
        quit()

    k -= jj
    
else:
    if ll >= k:
        print(n * (5**k))
        quit()    

    k -= ll

print(n * (2**jj) * (10**k) * (5 ** ll))


