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 gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(int a, int b) { return 1LL * a / gcd(a, b) * b; }
long long binpow(int n, long long k) {
  long long res = 1;
  while (k) {
    if (k % 2 == 1) res = res * n;
    n *= n;
    k /= 2;
  }
  return res;
}
int main() {
  int n, k;
  cin >> n >> k;
  cout << 1LL * lcm(n, binpow(10, k));
  return 0;
}
