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() {
  long long int n, k;
  cin >> n >> k;
  long long int req_twos = k;
  long long int req_fives = k;
  long long int fives = 0;
  long long int twos = 0;
  long long int temp = n;
  while (temp >= 1) {
    if (temp % 2 == 0) {
      twos++;
      temp = temp / 2;
    } else if (temp % 5 == 0) {
      fives++;
      temp = temp / 5;
    } else
      break;
  }
  long long int rem_twos = req_twos - twos;
  long long int rem_fives = req_fives - fives;
  for (long long int i = 1; i <= rem_twos; i++) n = n * 2;
  for (long long int i = 1; i <= rem_fives; i++) n = n * 5;
  cout << n << "\n";
}
