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;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int n, k;
  cin >> n >> k;
  long long int mul = 10;
  for (long long int i = 0; i < k - 1; i++) mul *= 10;
  long long int a = 0, b = 0;
  long long int x = n;
  while (x % 2 == 0 && x != 0) {
    x /= 2;
    a++;
  }
  x = n;
  while (x % 5 == 0 && x != 0) {
    x /= 5;
    b++;
  }
  for (long long int i = a + 1; i <= k; i++) n *= 2;
  for (long long int i = b + 1; i <= k; i++) n *= 5;
  cout << n;
  return 0;
}
