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.awt.image.BandedSampleModel;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class A{


    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);

        {
            long n=sc.nextLong();
            long k=sc.nextLong();
            long copy = n;

            /*int two=0;
            int five=0;
            while(copy%2==0)
            {
                two++;
                copy=copy/2;
            }
            while(copy%5==0)
            {
                five++;
                copy=copy/5;
            }

            if(k==0)
            {
                System.out.println(n);
            }
            else if(Math.min(two,five)>=k)
            {
                System.out.println(n);
            }
            else
            {
                long ans=copy;
                for(int j=0;j<k;j++)
                {
                    ans=ans*10;
                }

                while(ans%n!=0)
                {
                    ans=ans*10;
                }
                long ans2=n;
                int p=Math.min(two,five);
                for(int j=0;j<k-p;j++)
                {
                    ans2=ans2*10;
                }
                System.out.println(Math.min(ans,ans2));*/

            long d=1;
            for(int j=0;j<k;j++)
            {
                d=d*10;
            }

            while(copy%d!=0)
            {
                copy=copy*10;
            }

            while(copy%5==0&&(copy/5)%d==0&&(copy/5)%n==0)
            {
                copy=copy/5;
            }
            while(copy%2==0&&(copy/2)%d==0&&(copy/2)%n==0)
            {
                copy=copy/2;
            }

            System.out.println(copy);
            }
        }



    }

