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 maxn = 1e6 + 5;
const int mod = 1e9 + 7;
const long long INF = 2e15;
long long qpower(long long a, long long b) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) ans = ans * a % mod;
    b >>= 1;
    a = a * a % mod;
  }
  return ans;
}
long long n, k;
int main(int argc, char const *argv[]) {
  std::cin >> n >> k;
  if (k == 0) {
    std::cout << n << '\n';
    return 0;
  }
  int cnt = 0;
  for (int i = 0; i < k; i++) {
    if (n % 10 == 0) {
      cnt++;
      n /= 10;
    } else
      break;
  }
  for (int i = cnt; i < k; i++) {
    if (n % 5 == 0) n /= 5;
    if (n % 2 == 0) n /= 2;
  }
  for (int i = 1; i <= k; i++) {
    n *= 10;
  }
  std::cout << n << '\n';
  return 0;
}
