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() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    long long n, k;
    cin >> n >> k;
    int two = 0, five = 0;
    long long g = n;
    while (g % 2 == 0) {
      two++;
      g = g / 2;
    }
    while (g % 5 == 0) {
      five++;
      g = g / 5;
    }
    if (two >= k && five >= k) {
      cout << n;
      return 0;
    } else {
      cout << n *
                  (long long)pow(
                      (long long)2,
                      max((long long)k - (long long)two, (long long)0)) *
                  (long long)pow(
                      (long long)5,
                      max((long long)k - (long long)five, (long long)0));
      return 0;
    }
  }
  return 0;
}
