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 max(long long a, long long b) {
  if (a > b) return a;
  return b;
}
long long pow(long long a, long long n) {
  if (n == 0) return 1;
  long long now = 1;
  long long b = a;
  while (now != n) {
    a *= b;
    now++;
  }
  return a;
}
int main() {
  long long n, k;
  cin >> n >> k;
  long long n2 = 0;
  long long n5 = 0;
  long long n1 = n;
  while (n1 % 2 == 0) {
    n1 /= 2;
    n2++;
  }
  while (n1 % 5 == 0) {
    n1 /= 5;
    n5++;
  }
  if (min(n2, n5) >= k) {
    cout << n << '\n';
    return 0;
  }
  long long h2 = max(0, k - n5);
  cout << n * (1ll << (max(k - n2, 0))) * pow(5ll, h2) << "\n";
}
