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;
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
int main() {
  long long n, k, m, z = 0, g;
  cin >> n >> k;
  m = n;
  while (m and m % 10 == 0) {
    z++;
    m /= 10;
  }
  if (z >= k) {
    cout << n;
  } else {
    m = 1;
    while (k--) {
      m *= 10;
    }
    g = gcd(max(n, m), min(n, m));
    cout << (n / g) * m;
  }
}
