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
// package codeforces.A;

import java.util.*;

public class cf858A
{
    private static int[] factoring(int n)
    {
        int[] factors = {0, 0, 0};
        while (n % 5 == 0)
        {
            factors[1]++;
            n /= 5;
        }
        while (n % 2 == 0)
        {
            factors[0]++;
            n /= 2;
        }
        factors[2] = n;
        return factors;
    }

    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();
        int k = in.nextInt();

        int[] factors = factoring(n);
        factors[0] = Math.max(factors[0], k);
        factors[1] = Math.max(factors[1], k);

        long ans = factors[2];
        ans *= (long) Math.pow(2, factors[0]);
        ans *= (long) Math.pow(5, factors[1]);

        System.out.print(ans);
    }
}
