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 n;
  int k, kod = 0, d = 0;
  cin >> n >> k;
  while (kod == 0 && k > 0) {
    if (n % 10 == 0) {
      k--;
      d++;
      n /= 10;
    }
    if (n % 10 == 1 || n % 10 == 3 || n % 10 == 7 || n % 10 == 9) {
      kod = 1;
    }
    if (n % 10 == 2 || n % 10 == 4 || n % 10 == 6 || n % 10 == 8) {
      k--;
      n *= 5;
      n /= 10;
      d++;
    }
    if (n % 10 == 5) {
      k--;
      n *= 2;
      n /= 10;
      d++;
    }
  }
  cout << n;
  for (int i = 0; i < k + d; i++) cout << "0";
}
