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>
int numOfZeros(long long a) {
  int num = 0;
  while (a % 10 == 0) {
    a /= 10;
    ++num;
  }
  return num;
}
int main() {
  long long n, k;
  std::cin >> n >> k;
  int n1 = n;
  int twos = 0;
  int fives = 0;
  while (n1 % 2 == 0) {
    n1 /= 2;
    twos += 1;
  }
  while (n1 % 5 == 0) {
    n1 /= 5;
    fives += 1;
  }
  while (twos < k) {
    n *= 2;
    twos += 1;
  }
  while (fives < k) {
    n *= 5;
    fives += 1;
  }
  std::cout << n;
}
