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;
int main() {
  unsigned long long ans;
  unsigned long long num2 = 0, num5 = 0;
  unsigned long long n, k;
  cin >> n >> k;
  while (n % 2 == 0 && n / 2 > 0) {
    n /= 2;
    num2++;
  }
  while (n % 5 == 0 && n / 5 > 0) {
    n /= 5;
    num5++;
  }
  unsigned long long num22 = pow(2, num2), num55 = pow(5, num5);
  if (k > num2)
    num2 = k - num2;
  else
    num2 = 0;
  if (k > num5)
    num5 = k - num5;
  else
    num5 = 0;
  num22 *= pow(2, num2);
  num55 *= pow(5, num5);
  ans = n * num22 * num55;
  cout << ans;
  return 0;
}
