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;
bool DEB = 0;
void __start__() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
mt19937_64 rnd(time(0));
using ll = long long;
using vi = vector<int>;
using ld = long double;
using pii = pair<int, int>;
void test_case() {
  ll n, k, two, five, c = 1;
  cin >> n >> k;
  two = k;
  five = k;
  while (n % 2 == 0 && two) n /= 2, two--;
  while (n % 5 == 0 && five) n /= 5, five--;
  cout << n << string(k, '0');
}
signed main() {
  __start__();
  int Q = 1;
  while (Q--) test_case();
}
