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
#!/usr/bin/env python3

def ns(n, d):
    x = 0
    while not (n % d):
        x += 1
        n //= d
    return x

def tozero(x):
    return x if x >= 0 else 0

def m(n, k):
    n5 = ns(n, 5)
    n2 = ns(n, 2)
    return n * (2 ** tozero(k - n2)) * (5 ** tozero(k - n5))

if __name__ == "__main__":
    n, k = map(int, input().split())
    print(m(n, k))
