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.*; 
import java.util.Scanner;
import java.util.Arrays;
import java.util.ArrayList;
import java.lang.*; 
public class Solution{
 
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in); 
		long n = in.nextLong();
		long m = in.nextLong();
		long ans = 0;
		long index = 0;
		long temp = m;
		while(temp>0){
		    if(index==0){
		        index++;
		    }
		    else{
		        index*=10;
		    }
		    temp--;
		}
		index*=10;
		long index2 = index;
		if(m==0){
		    System.out.println(n);
		}
		else{
		    ans = lcm(n,index);
		    System.out.println(ans);
		}
	}
	public static long lcm(long a, long b){
	    return a * b / gcd(a,b);
	}
	public static long gcd(long a, long b){
	    if(b==0){
	        return a;
	    }
	    return gcd(b, a%b);
	}
}