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;
const int N = int(4e5) + 5;
const int inf = (int)1e9 + 7;
const long long linf = (long long)1e17 + 7;
const long double eps = 1e-7;
long long ond = 1, e, q, k, zero;
int main() {
  cin >> q >> k;
  e = q;
  for (long long i = 1; i <= k; i++) ond *= 10;
  for (long long i = 1; i <= ond; i++) {
    if (e % ond == 0) {
      cout << e;
      return 0;
    }
    e += q;
  }
  return 0;
}
