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 static fast = []() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  return 0;
}();
int main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> fac = {2, 5};
  vector<long long> prime = {0, 0};
  for (int i = 0; i < fac.size(); i++) {
    while (n % fac[i] == 0) {
      prime[i] += 1;
      n /= fac[i];
    }
    prime[i] = max(prime[i], k);
    while (prime[i]-- > 0) n *= fac[i];
  }
  cout << n << "\n";
  return 0;
}
