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
/* package whatever; // don't place package name! */
 
import java.util.*;
import java.lang.*;
import java.io.*;
 
/* Name of the class has to be "Main" only if the class is public. */
public class bbg
{
	public static int result;
 
public static ArrayList<Integer> [] graph;
 
public static int[]cats;
 
public static int vizitat[];
public static int x;
 
 
	public static void main (String[] args) throws java.lang.Exception
{
 
Scanner input=new Scanner(System.in);
 
HashMap<Integer, Integer> contor1= new HashMap<Integer, Integer>();
HashMap<Integer, Integer> contor2= new HashMap<Integer, Integer>();


HashMap<Integer, Integer> map= new HashMap<Integer, Integer>();
HashMap<Integer, Integer> stop= new HashMap<Integer, Integer>();
 
		
		Long n=input.nextLong();
		Long k=input.nextLong();
		
	
		

		
		if(k==0) System.out.println(n);
		
		else if (cifrezero(n)>=k) System.out.println(n);
		
		
		else{
		
		int number=0;
			Long rasp=n;
		int x=0;
		
		
		for(int i=1;i<=500000;i++)
		{
		    
		    Long prod=n*i*1L;
		    
	//	 System.out.println(i+" "+prod+" ");
		    
		    
		    if(cifrezero(prod)>number && cifrezero(prod)<=k) {rasp=prod; number=cifrezero(prod);}
		    
		  else   if(cifrezero(prod)==number && prod<rasp ) {rasp=prod;
		    number=cifrezero(prod);}
		
		    
		    
		}
		
		
		
		System.out.print(rasp);
		
	for(int j=1;j<=k-cifrezero(rasp);j++) System.out.print("0");
		
		}
			
		}
		
		public static int cifrezero(Long nr){
			
			Long part=nr;
			int contor=0;
			while(part>0l && part%10==0){
				contor++;
				part=part/10l;

			}
			
			return contor;

	
			
			
			
		}


		}