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
import sys, math

def factorization(num):
    res = dict()
    x = 2
    while x ** 2 <= num:
        while num % x == 0:
            if x in res:
                res[x] += 1
            else:
                res.update({x : 1})
            num //= x
        x += 1
    if num > 1:
        if num in res:
            res[num] += 1
        else:
            res.update({num : 1})
    return res



n, k = map(int, sys.stdin.readline().split())
now = factorization(n)
two = 0
five = 0
if 2 in now:
    two = now[2]
if 5 in now:
    five = now[5]
temp = min(two, five)
if temp >= k:
    need_two = k - five
    need_five = k - two
    if need_two <= 0 and need_five > 0:
        print(n * pow(2, need_five))
    elif need_two > 0 and need_five <= 0:
        print(n * pow(2, need_two))
    elif need_two <= 0 and need_five <= 0:
        print(n)
else:
    need_two = k - two
    need_five = k - five
    if need_two <= 0 and need_five > 0:
        print(n * pow(5, need_five))
    elif need_two > 0 and need_five <= 0:
        print(n * pow(2, need_two))
    elif need_two > 0 and need_five > 0:
        print(n * pow(2, need_two) * pow(5, need_five))