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
from fractions import gcd

n,k = raw_input().split()
n = int(n)
k = int(k)

if n % pow(10,k) == 0:
	print n
	exit(0)

max_pot = [0,0]
for i in range(9):
	if n % pow(2,i) == 0:
		max_pot[0] = i
	if n % pow(5,i) == 0:
		max_pot[1] = i


answer = n
if max_pot[0] < k:
	answer = answer * pow(2,k-max_pot[0])
if max_pot[1] < k:
	answer = answer * pow(5,k-max_pot[1])

print answer
		

