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;
const long long int INF = LONG_LONG_MAX;
const long long int NINF = LONG_LONG_MIN;
const long long int mmod = 998244353;
long long int dsum(long long int n) {
  long long int sum = 0;
  while (n) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long int n, k;
  cin >> n >> k;
  long long int v = n;
  vector<long long int> fact;
  for (long long int i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      fact.push_back(i);
      n /= i;
    }
  }
  if (n > 0) fact.push_back(n);
  long long int two = 0, five = 0;
  for (long long int i = 0; i < (long long int)fact.size(); i++) {
    if (fact[i] == 2) two++;
    if (fact[i] == 5) five++;
  }
  if (min(two, five) < k) {
    while (two < k) {
      two++;
      v *= 2;
    }
    while (five < k) {
      five++;
      v *= 5;
    }
  }
  cout << v << endl;
}
