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 int_pow(int n, int x) {
  int res = 1;
  for (int i = 0; i < x; ++i) res *= n;
  return res;
}
int main() {
  int n, k;
  cin >> n >> k;
  int c2 = 0, c5 = 0;
  while (n % 2 == 0) {
    ++c2;
    n /= 2;
  }
  while (n % 5 == 0) {
    ++c5;
    n /= 5;
  }
  c2 = max(c2, k);
  c5 = max(c5, k);
  cout << n * 1ll * int_pow(2, c2) * int_pow(5, c5);
}
