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 NOD(long long a, long long a1) {
  if (a == 0 || a1 == 0)
    return a > a1 ? a : a1;
  else if (a > a1)
    return NOD(a %= a1, a1);
  else
    return NOD(a, a1 %= a);
}
int main() {
  long long n, n1, k = 1, i;
  cin >> n >> n1;
  for (i = 1; i <= n1; i++) k *= 10;
  cout << (n * k) / NOD(n, k);
}
