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 java.math.BigInteger;
import java.util.Scanner;

public class KRounding {
    private Scanner reader = new Scanner(System.in);

    public static void main(String[] args) {
        new KRounding().solve();
    }

    private void solve() {
        int k;
        int n;

        n = reader.nextInt();
        k = reader.nextInt();

        int aNumber = (int) Math.pow(10, k);

        BigInteger aa = new BigInteger(String.valueOf(n));
        BigInteger ab = new BigInteger(String.valueOf(aNumber));
        BigInteger g = new BigInteger(String.valueOf(GCD(n, aNumber)));
        BigInteger mul = aa.multiply(ab);

        BigInteger res = mul.divide(g);

        System.out.println(res);
    }

    private int GCD(int a, int b) {
        if (b == 0) return a;
        return GCD(b, a % b);
    }
}
