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>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n = 0;
  long long k = 0;
  cin >> n >> k;
  long long am2 = 0, am5 = 0, cn = n;
  while (cn % 2 == 0) {
    cn /= 2;
    am2++;
  }
  while (cn % 5 == 0) {
    cn /= 5;
    am5++;
  }
  for (int i = 0; i < k - am2; i++) n *= 2;
  for (int i = 0; i < k - am5; i++) n *= 5;
  cout << n;
  return 0;
}
