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
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
//package codeforces;
import java.math.BigInteger;
import java.util.*;
/**
 *
 * @author Ashraf
 */
public class DVA {
    public static void main(String []args){
        Scanner in=new Scanner(System.in);
        long n=in.nextLong();
        int k=in.nextInt();
        long sum=(long)Math.pow(10, k);
        BigInteger b1 = new BigInteger(""+n); // there's a better way to do this. I forget.
        BigInteger b2 = new BigInteger(""+sum);
        BigInteger gcd = b1.gcd(b2);
        long x=gcd.intValue();
        //System.out.println(x);
        System.out.println((n*sum)/x);
    }
}
