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
/*
 * http://codeforces.com/problemset/problem/858/A
 */

/*  Basic import definitions    */
    import java.util.*;
    import java.math.BigInteger;
    import java.util.LinkedList;

/*  Basic Class definitions*/
    public class kRounding
    {
        public static void main(String[] args) 
        {
            Scanner sc = new Scanner(System.in);

            int i , j , k;
            int t,N;
            i=0;
            j=0;
            int min = 0;
            N = Integer.parseInt(sc.next());
            k = Integer.parseInt(sc.next());
            int m = N;
            BigInteger cat;
            t=1;

            while(m%2 == 0)
            {
                i++;
                m/=2;
            }
            m=N;
            min = i;
            while(m%5 == 0)
            {
                j++;
                m/=5;
            }
            if(j<min)
                min = j;
                
            //System.out.println("i " + i + " j " + j + " min " +min);
            
            cat = BigInteger.valueOf(N);
            
            if(min >= k)
                System.out.println(N);
            
            else
            {
                i-= min;
                j-= min;
                k-= min;
                
                if(i<0)
                    i=0;
                if(j<0)
                    j=0;
                
                if(i==0)
                {
                    t = (int)Math.pow(2,k);
                    cat = cat.multiply(BigInteger.valueOf(t));
                    if(k-j < 0)
                        j=k;
                
                    t = (int)Math.pow(5,k-j);
                    cat = cat.multiply(BigInteger.valueOf(t));
                }
                else
                {
                    if(k-i < 0)
                        i=k;
                    t = (int)Math.pow(2,k-i);
                    cat = cat.multiply(BigInteger.valueOf(t));
                    t = (int)Math.pow(5,k);
                    cat = cat.multiply(BigInteger.valueOf(t));
                }
                System.out.println(cat);
            }
        }
    }
    
