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;
vector<long long int> adj[1000001];
int32_t main() {
  long long int n, k, cnt2, cnt5, temp, zero;
  cnt2 = cnt5 = 0;
  cin >> n >> k;
  temp = n;
  while (temp % 2 == 0 || temp % 5 == 0) {
    if (temp % 2 == 0) {
      temp /= 2;
      cnt2++;
    }
    if (temp % 5 == 0) {
      temp /= 5;
      cnt5++;
    }
  }
  zero = min(cnt2, cnt5);
  if (zero == k) {
    return cout << n, 0;
  }
  cnt2 -= zero;
  cnt5 -= zero;
  k -= zero;
  for (long long int i = 0; i < cnt2; i++) {
    n *= 5;
    k--;
    if (k < 1) break;
  }
  for (long long int i = 0; i < cnt5; i++) {
    n *= 2;
    k--;
    if (k < 1) break;
  }
  while (k > 0) {
    n *= 10;
    k--;
  }
  cout << n;
}
