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
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long aux, n, k, dois = 0, cinco = 0, num = 1;
  scanf("%lld %lld", &n, &k);
  aux = n;
  while (aux % 2 == 0) {
    aux /= 2;
    dois++;
  }
  while (aux % 5 == 0) {
    aux /= 5;
    cinco++;
  }
  if (k - dois > 0) {
    num *= pow(2, k - dois);
  }
  if (k - cinco > 0) {
    num *= pow(5, k - cinco);
  }
  printf("%lld\n", n * num);
}
