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.io.*;
import java.util.*;

public class KRounding {
  public static void main (String [] args) throws IOException {
    Scanner in = new Scanner(System.in);

    final long n = in.nextInt();
    final int k = in.nextInt();

    int twos = 0;
    long divisor = n;
    while (divisor % 2 == 0) {
      divisor /= 2;
      ++twos;
    }

    int fives = 0;
    while (divisor % 5 == 0) {
      divisor /= 5;
      ++fives;
    }

    int zeros = 0;
    long result = n;
    while (zeros < k) {
      if (twos > 0 && fives > 0) {
        --twos;
        --fives;
        ++zeros;
      } else if (fives > 0) {
        result *= 2;
        --fives;
        ++zeros;
      } else if (twos > 0) {
        result *= 5;
        --twos;
        ++zeros;
      } else {
        result *= 10;
        ++zeros;
      }
    }

    System.out.println(result);

  }
}