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 int n;
  cin >> n;
  int k;
  cin >> k;
  long long int p = 1;
  while (k--) {
    p *= 10;
  }
  long long int c = p;
  if (n % p == 0 || k == 0) {
    cout << n;
    return 0;
  }
  if (p % n == 0) {
    cout << p;
    return 0;
  }
  if (p <= n) {
    p = n;
  } else if (p > n) {
    long long int q = p % n;
    p = p + (n - q);
  }
  for (long long int x = p;; x += n) {
    if (x % c == 0) {
      cout << x;
      return 0;
    }
  }
}
