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.util.Scanner;

public class TaskA {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        TaskA inst = new TaskA();
        long n = in.nextLong(), k = in.nextLong();
        System.out.println(
                (long)(n * Math.pow(10, k) / inst.gcd(n, (long) Math.pow(10, k)))
        );
    }
    private long gcd(long a, long b){
        return b == 0 ? a : gcd(b, a % b);
    }
}
