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;
bool issq(long long x) {
  if ((long long)sqrt(x) * (long long)sqrt(x) == x) {
    return true;
  } else {
    return false;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, k;
  while (cin >> n >> k) {
    int two = k, five = k;
    long long tmp = n;
    while (n % 2 == 0 && two) {
      n /= 2;
      two--;
    }
    while (n % 5 == 0 && five) {
      n /= 5;
      five--;
    }
    n = tmp;
    while (two--) {
      n *= 2;
    }
    while (five--) {
      n *= 5;
    }
    cout << n << endl;
  }
}
