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 H {
	
	
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		long n = sc.nextLong();
		int k=sc.nextInt();
		
		int max2=0;
		int max5=0;
		
		for(int i=0;i<9;i++){
			if(n%Math.pow(2,i)==0){
				max2=i;
			}
			if(n%Math.pow(5,i)==0){
				max5=i;
			}
		}
		
		long pot2=k>=max2?(long)Math.pow(2,k-max2):1;
		long pot5=k>=max5?(long)Math.pow(5,k-max5):1;
		
		
		
		System.out.print(n*pot2*pot5);
		
	}

}
