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;

public class N1_tech_17092017 {
    public static void main(String[] args) {
        Scanner scanner =new Scanner(System.in);
        long a=scanner.nextInt();
        int b=scanner.nextInt();
        //boolean flag=false;
        long res;
        //if ((a%10)%2==0)flag=true;

        long k=func(a);
        //465

        if (k>=b)res=a;else
        {
            long second =function2(a);
            long fifth=function5(a);
            long fid;
            if (second>fifth){
                fid=second-fifth;
                for (int i=0;i<fid;i++)
                {
                    if(func(a)>=b)break;
                    a*=5;
                }
            }else {
                fid=fifth-second;
                for (int i=0;i<fid;i++)
                {
                    if(func(a)>=b)break;
                    a*=2;
                }
            }
                //res=a;
                while (func(a)<b)
                {
                    a*=10;
                }
                res=a;

        }
        System.out.println(res);
    }
    public static long func(long a)
    {
        long k=0;
        while (a!=0) {
            if ((a%10)==0)k++ ;else break;
            a=a/10;
        }
        return k;
    }
    public static long function5 (long a){
        long k=0;
        while (a%5==0){
            k++;
            a/=5;
        }
        return k;
    }
    public static long function2 (long a){
        long k=0;
        while (a%2==0){
            k++;
            a/=2;
        }
        return k;
    }
    /*public static long function5 (long a){
        long k=0;
        while (a%5==0){
            k++;
            a/=5;
        }
        return k;
    }*/
}
