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;
unsigned long long int n, k;
unsigned long long int pw(unsigned long long int base,
                          unsigned long long int p) {
  unsigned long long int ans = 1;
  for (unsigned long long int i = 1; i <= p; i++) ans *= base;
  return ans;
}
unsigned long long int calc(unsigned long long int n) {
  unsigned long long int c2 = 0, c5 = 0, temp = n, m2 = 1, m5 = 1;
  if (temp % 2 == 0)
    while (temp % 2 == 0) c2++, temp /= 2;
  temp = n;
  if (temp % 5 == 0)
    while (temp % 5 == 0) c5++, temp /= 5;
  if (c2 < k) m2 = pw(2, k - c2);
  if (c5 < k) m5 = pw(5, k - c5);
  return n * m2 * m5;
}
int main() {
  cin >> n >> k;
  cout << calc(n) << endl;
}
