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.Arrays;
public class MarvoloRing {
    public static void main(String[] args) {
        Scanner kbd = new Scanner(System.in);
        String inp = kbd.nextLine();
        String[] input = inp.split(" ");
        long inputOne = Long.parseLong(input[0]);
        long inputTwo = Long.parseLong(input[1]);
        long temp = 1;
        
        if(inputOne > 0){
        	for(int ctr = 1; ctr <= inputTwo; ctr++){
        			temp *= 10;
        		}
        	System.out.println(inputOne*temp/gcd(temp, inputOne));
        	}
        }
        
        public static long gcd(long valueOne, long valueTwo){
        	if(valueTwo == 0){
        		return valueOne;
        	}else{
        		return gcd(valueTwo, valueOne%valueTwo);
        	}
        }
}
