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 n, n2, k, ans, s2, s5, k2, k5, st2, st5;
int main() {
  cin >> n >> k;
  n2 = n;
  while (n % 2 == 0) {
    n /= 2;
    s2++;
  }
  while (n % 5 == 0) {
    n /= 5;
    s5++;
  }
  if (s2 > k) {
    k2 = 0;
  } else {
    k2 = k - s2;
  }
  if (s5 > k) {
    k5 = 0;
  } else {
    k5 = k - s5;
  }
  st2 = 1;
  st5 = 1;
  for (int i = 0; i < k2; i++) {
    st2 *= 2;
  }
  for (int i = 0; i < k5; i++) {
    st5 *= 5;
  }
  ans = n2 * st2 * st5;
  cout << ans;
  return 0;
}
