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 n, k;
  cin >> n >> k;
  long long z = n;
  vector<long long> v;
  long long two = 0, five = 0;
  for (long long i = 2; i * i <= z; i++) {
    while (z % i == 0) {
      v.push_back(i);
      z /= i;
      if (i == 2) two++;
      if (i == 5) five++;
    }
  }
  if (z > 1) {
    v.push_back(z);
    if (z == 2) two++;
    if (z == 5) five++;
  }
  long long t = min(two, five);
  k -= t;
  two -= t;
  five -= t;
  if (k < 0) k = 0;
  long long five_need = k - five;
  long long two_need = k - two;
  if (five_need < 0) five_need = 0;
  if (two_need < 0) two_need = 0;
  while (five_need-- && k > 0) v.push_back(5);
  while (two_need-- && k > 0) v.push_back(2);
  long long v_size = v.size(), x = 1;
  for (long long i = 0; i < v_size; i++) x *= v[i];
  cout << x << endl;
}
