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;
void task2() {
  int n, m;
  cin >> n >> m;
  vector<int> a(m), b(m);
  for (int i = 0; i < m; i++) {
    cin >> a[i] >> b[i];
  }
  set<int> possible;
  for (int count = 1; count < 101; count++) {
    bool ok = true;
    for (int i = 0; i < m; i++) {
      if ((a[i] - 1) / count + 1 != b[i]) {
        ok = false;
        break;
      }
    }
    if (ok) {
      possible.insert((n - 1) / count + 1);
    }
  }
  if (possible.size() == 1) {
    cout << *(possible.begin());
  } else {
    cout << -1;
  }
}
int gcd(int a, int b) {
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
void task1() {
  long long n, k;
  cin >> n >> k;
  int a = 1;
  for (int i = 0; i < k; ++i) {
    a *= 10;
  }
  cout << n * a / gcd(n, a);
}
int main() {
  task1();
  return 0;
}
