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;
  while (cin >> n >> k) {
    int cnt1 = 0, cnt2 = 0;
    unsigned long long t = n;
    while (t % 5 == 0) {
      cnt1++;
      t /= 5;
    }
    while (t % 2 == 0) {
      cnt2++;
      t /= 2;
    }
    int cnt = min(cnt1, cnt2);
    int cntk = max(cnt1, cnt2);
    if (cnt < k) {
      if (cnt1 < cnt2) {
        for (int i = cnt1 + 1; i <= min(cntk, k); ++i) {
          n = n * 5;
        }
      } else if (cnt1 > cnt2) {
        for (int i = cnt2 + 1; i <= min(cntk, k); ++i) {
          n = n * 2;
        }
      }
      if (cntk < k) {
        for (int i = 1; i <= k - cntk; ++i) {
          n = n * 10;
        }
      }
    }
    cout << n << endl;
  }
}
