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 powCount(long long a, long long b) {
  long long count = 0;
  while (a % b == 0) {
    a /= b;
    count++;
  }
  return count;
}
long long power(long long a, long long b) {
  long long res = 1;
  while (b--) {
    res *= a;
  }
  return res;
}
int main() {
  long long n, k;
  cin >> n >> k;
  long long powTwo = powCount(n, 2);
  long long powFive = powCount(n, 5);
  long long rem = n / power(2, powTwo) / power(5, powFive);
  long long newPowTwo = (powTwo - k > 0) ? powTwo - k : 0;
  long long newPowFive = (powFive - k > 0) ? powFive - k : 0;
  long long result =
      power(2, newPowTwo) * power(5, newPowFive) * power(10, k) * rem;
  cout << result;
}
