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
def rec(i):
    global a
    return i
import sys
from collections import Counter
sys.setrecursionlimit(10**6)
#n=int(input())
a,b=list(map(int,input().split()))
z=a
c=0
while a%5==0:
    c=c+1
    a=a//5
d=0
while a%2==0:
    d=d+1
    a=a//2
#c=min(b,c)
#d=min(b,d)
for i in range(b-c):
    z=z*5
for i in range(b-d):
    z=z*2
print(z)
