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.io.PrintWriter;
import java.util.Scanner;

public class Main {
    Scanner in;
    PrintWriter out;

    int n, k;

    void run() throws Exception {
        in = new Scanner(System.in);
        out = new PrintWriter(System.out);

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

        out.print(lcm(n, (int) Math.pow(10, k)));

        in.close();
        out.close();
    }

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

    long lcm(int a, int b) {
        return (long) a / gcd(a, b) * b;
    }

    public static void main(String[] args) throws Exception {
        new Main().run();
    }
}