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;
template <typename T>
void out(T x) {
  cout << x << endl;
  exit(0);
}
const int maxn = 1e6 + 5;
long long n, k;
long long count(long long x, long long f) {
  long long cnt = 0;
  while (x % f == 0) {
    x = x / f;
    cnt++;
  }
  return cnt;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  long long twos = k;
  long long fives = k;
  long long n2 = count(n, 2);
  long long n5 = count(n, 5);
  long long ans = n;
  for (int i = 0; i < (int)(twos - n2); i++) {
    ans *= 2LL;
  }
  for (int i = 0; i < (int)(fives - n5); i++) {
    ans *= 5LL;
  }
  out(ans);
  return 0;
}
