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

public class Main {
    static class Reader {
        BufferedReader in;

        Reader() throws IOException {
            in = new BufferedReader(new InputStreamReader(System.in));
        }

        Reader(String name) throws IOException {
            in = new BufferedReader(new FileReader(name));
        }

        StringTokenizer tokin = new StringTokenizer("");

        void updtokin() throws IOException {
            if (!tokin.hasMoreTokens()) {
                String a = in.readLine();
                if (a != null) {
                    tokin = new StringTokenizer(a);
                }
            }
        }

        String next() throws IOException {
            updtokin();
            return tokin.nextToken();
        }

        int nextInt() throws IOException {
            updtokin();
            return Integer.parseInt(tokin.nextToken());
        }
    }

    public static void main(String args[]) throws IOException {
        Reader in = new Reader();
        long n = in.nextInt();
        long k = in.nextInt();
        long n1 = n;
        long pow5 = 0;
        long pow2 = 0;
        while(n1%2 == 0){
            pow2++;
            n1 /= 2;
        }
        while(n1%5 == 0){
            pow5++;
            n1 /= 5;
        }
        if(pow5 > pow2){
            for (k = k;  pow2 < pow5 && pow2 < k; pow2++) {
                n*=2;
            }
        } else {
            for (k = k;  pow5 < pow2 && pow5 < k; pow5++) {
                n*=5;
            }
        }
        for (k = k; pow2 < k; k--) {
            n*=10;
        }
        System.out.println(n);
    }
}
