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 Numoftwo(long long n) {
  int c = 0;
  while (n && n % 2 == 0) {
    n /= 2;
    c++;
  }
  return c;
}
int Numoffive(long long n) {
  int c = 0;
  while (n && n % 5 == 0) {
    n /= 5;
    c++;
  }
  return c;
}
int check(int k, long long n) {
  if ((min(Numoftwo(n), Numoffive(n))) == k)
    return 0;
  else if (min(Numoftwo(n), Numoffive(n)) < k)
    return 1;
  else if (min(Numoftwo(n), Numoffive(n)) > k)
    return 100;
}
int main() {
  long long int n, k;
  cin >> n >> k;
  while (check(k, n) != 0 && check(k, n) != 100) {
    if (check(k, n) == 1) {
      if (Numoftwo(n) < Numoffive(n))
        n *= 2;
      else if (Numoftwo(n) > Numoffive(n))
        n *= 5;
      else
        n *= 10;
    }
  }
  cout << n << endl;
  return 0;
}
