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 int N = 2e4 + 10;
const double eps = 1e-9;
const long long inf = 1e18;
long long ans = 1ll << 60;
long long n;
int k;
vector<long long> v;
int main() {
  cin >> n >> k;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      v.push_back(i);
      if (n / i != i) v.push_back(n / i);
    }
  }
  long long F = 1;
  for (int i = 0; i < k; i++) F *= 10;
  sort(v.begin(), v.end());
  for (auto x : v) {
    long long tmp = x * F * 1ll;
    if (tmp % n == 0) {
      cout << tmp;
      return 0;
    }
  }
}
