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() {
  srand(time(NULL));
  long long x, y;
  cin >> x >> y;
  long long cnt2 = 0, cnt5 = 0;
  long long b = x;
  while (x % 2 == 0) cnt2++, x /= 2;
  while (x % 5 == 0) cnt5++, x /= 5;
  x = b;
  while (cnt2 < min(cnt5, y)) x *= 2, cnt2++;
  while (cnt5 < min(cnt2, y)) x *= 5, cnt5++;
  while (cnt2 < y) x *= 10, cnt2++;
  cout << x;
}
