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 power(long long a, long long k) {
  if (!k) {
    return 1;
  }
  return a * (power(a, k - 1));
}
int main() {
  long long n, k, q;
  cin >> n >> k;
  q = n;
  long long cnt2 = 0, cnt5 = 0;
  while (n % 2 == 0) {
    cnt2++;
    n /= 2;
  }
  while (n % 5 == 0) {
    cnt5++;
    n /= 5;
  }
  long long k2 = power(2LL, max(0LL, k - cnt2)),
            k5 = power(5LL, max(0LL, k - cnt5));
  cout << k2 * k5 * q;
}
