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 gcd(int a, int b) {
  if (a < b) {
    swap(a, b);
  }
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int main() {
  long long unsigned n;
  int k;
  cin >> n >> k;
  if (k == 0) {
    cout << n;
    return 0;
  }
  if (k == 1) k = 10;
  if (k == 2) k = 100;
  if (k == 3) k = 1000;
  if (k == 4) k = 10000;
  if (k == 5) k = 100000;
  if (k == 6) k = 1000000;
  if (k == 7) k = 10000000;
  if (k == 8) k = 100000000;
  cout << (n * k) / gcd(n, k);
  return 0;
}
