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;
inline long long ksm(long long base, long long power) {
  long long result = 1;
  while (power > 0) {
    if (power & 1) result = result * base;
    power >>= 1;
    base = base * base;
  }
  return result;
}
long long GCD(long long x, long long y) { return y == 0 ? x : GCD(y, x % y); }
inline long long LCM(long long x, long long y) { return x / GCD(x, y) * y; }
int main() {
  long long n, m;
  cin >> n >> m;
  cout << LCM(n, ksm(10, m));
  return 0;
}
