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;
long long NOD(int a, int d) {
  if (a != 0)
    return NOD(d % a, a);
  else
    return d;
}
long long NOK(int a, int d) { return (a / NOD(a, d)) * d; }
int main() {
  int a;
  int b;
  int c;
  int d;
  d = 1;
  cin >> a >> b;
  for (b; b--; b >= 0) {
    d = d * 10;
  }
  cout << NOK(a, d) << endl;
}
