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.*;
import java.io.*;

public class A858 {
	public static void main(String args[])throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer str = new StringTokenizer(br.readLine());
		long n = Integer.parseInt(str.nextToken());
		int k = Integer.parseInt(str.nextToken());
		int numTwos = numPowers(n, 2);
		int numFives = numPowers(n, 5);
		int min = Math.min(numTwos, numFives);
		if(min >= k) {
			System.out.println(n);
			return;
		}
		k-=min;
		numFives -= min;
		numTwos -= min;
		if(Math.max(numFives, numTwos) >= k) {
			if(numFives >numTwos) {
				System.out.println((long)n* (long)Math.pow(2, k));
				return;
			}
			else {
				System.out.println((long)n* (long)Math.pow(5, k));
				return;
			}
		} else {
			long aux = 1;
			while(k>0) {
				if(numTwos >0) {
					numTwos --;
					k--;
					aux*=5;
				}
				else if(numFives >0) {
					numFives --;
					k--;
					aux*=2;
				}
				else {
					k--;
					aux*=10;
				}
			}
			System.out.println((long)n*aux);
		}
	}
	public static int numPowers(long n, int x) {
		int result =0;
		while(n>0 && n%x ==0) {
			n/=x;
			result++;
		}
		return result;
	}
}
