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.*;
import java.util.*;

public class Test1 {

    public static void main(String[]args) {
        Scanner in = new Scanner(System.in);
        BigInteger n = in.nextBigInteger(), l = new BigInteger("1");
        int k = in.nextInt();
        for(int i = 0; i<k; i++) l = l.multiply(BigInteger.valueOf(10));
        System.out.print(lcm(l, n));
    }

    static BigInteger  gcd (BigInteger a, BigInteger b){
        while(!b.equals(BigInteger.valueOf(0))){
            BigInteger tmp = a.mod(b);
            a = b;
            b = tmp;
        }
        return a;
    }

    static BigInteger lcm(BigInteger a, BigInteger b){
        return a.multiply(b).divide(gcd(a, b));
    }
}