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;
ostream& operator<<(ostream& out, vector<int>& lst) {
  for (auto a : lst) out << a << ' ';
  out << '\n';
  return out;
}
int gcd(int a, int b) {
  if (b > a) swap(a, b);
  while (a * b != 0) {
    int c = a % b;
    a = b;
    b = c;
  }
  return a;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  long long n, k;
  cin >> n >> k;
  long long a = 0, b = 0;
  int m = n;
  while (m % 5 == 0) m /= 5, a++;
  while (m % 2 == 0) m /= 2, b++;
  long long c = max(0ll, k - a);
  long long d = max(0ll, k - b);
  for (long long i = 0; i < c; i++) n *= 5;
  for (long long i = 0; i < d; i++) n *= 2;
  cout << n;
  return 0;
}
