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;
void solve() {
  long long n, k;
  cin >> n >> k;
  long long temp;
  temp = n;
  int c2 = 0, c5 = 0;
  while (temp > 1) {
    if (temp % 2 == 0) {
      c2++;
    } else
      break;
    temp /= 2;
  }
  temp = n;
  while (temp > 1) {
    if (temp % 5 == 0) {
      c5++;
    } else
      break;
    temp /= 5;
  }
  if (c2 < k) {
    while (c2 != k) {
      n *= 2;
      c2++;
    }
  }
  if (c5 < k) {
    while (c5 != k) {
      n *= 5;
      c5++;
    }
  }
  cout << n << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
