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;
const long long N = 103, NUM = 10, BIG = 1e9, MOD = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long n, nn, k;
  cin >> n >> k;
  nn = n;
  long long st_2 = 0, st_5 = 0;
  while (nn % 2 == 0) {
    nn /= 2;
    st_2++;
  }
  while (nn % 5 == 0) {
    nn /= 5;
    st_5++;
  }
  long long ans = 1;
  for (int i = st_2; i < k; i++) ans *= 2;
  for (int i = st_5; i < k; i++) ans *= 5;
  cout << n * ans;
  return 0;
}
