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() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int i, m, n, x, j = 0, c = 0, r = 0, w, s, d = 0, f = 0, sum = 0,
                            mul, s1 = 0, s2 = 0;
  cin >> n >> x;
  m = n;
  while (n % 10 == 0) {
    n /= 10;
    d++;
  }
  if (n % 2 == 1 && n % 10 != 5) {
    cout << m;
    for (i = 1; i <= (x - d); i++) {
      cout << "0";
    }
    cout << endl;
  } else if (n % 5 == 0) {
    s = 0;
    f = 0;
    x = x - d;
    i = 2;
    s2 = n;
    while (s < x) {
      f = 0;
      s1 = n * i;
      i += 2;
      s2 = s1;
      while (s1 % 10 == 0) {
        s1 /= 10;
        f++;
      }
      s = f;
    }
    cout << s2;
    for (i = 1; i <= d; i++) cout << "0";
  } else {
    s = 0;
    f = 0;
    x = x - d;
    i = 5;
    s2 = n;
    while (s < x) {
      f = 0;
      s1 = n * i;
      i += 5;
      s2 = s1;
      while (s1 % 10 == 0) {
        s1 /= 10;
        f++;
      }
      s = f;
    }
    cout << s2;
    for (i = 1; i <= d; i++) cout << "0";
  }
  return 0;
}
