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;

import java.util.Stack;

public class _1011krounding {
	public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	long n=sc.nextLong();
	long k=sc.nextLong();
	long ktwos=k;
	long kfives=k;
	long temp=n;
	while(n%2==0 || n%5==0) {
		if(n%2==0) {
			n=n/2;
			ktwos--;
		}
		if(n%5==0) {
			n=n/5;
			kfives--;
		}
	}
//	System.out.println(n+" "+kfives+" "+ktwos);
	long ans=(long) (temp*Math.pow(5,Math.max(0, kfives))*Math.pow(2,Math.max(0, ktwos)));
	System.out.println(ans);
		
	}

}
