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;
const long long mod = 1e9 + 7;
long long ppow(long x, long s) {
  if (!s) return 1;
  if (!(s - 1)) return x % mod;
  if (s % 2) return (x * ppow(x, s - 1)) % mod;
  long long b = ppow(x, s / 2);
  return (b * b) % mod;
}
int main() {
  long long n, k, i, m, divisioni = 0;
  cin >> n >> k;
  while ((n % 5 == 0) && (divisioni < k)) {
    n = n / 5;
    divisioni++;
  }
  divisioni = 0;
  while ((n % 2 == 0) && (divisioni < k)) {
    n = n / 2;
    divisioni++;
  }
  cout << n * ppow(10, k);
  return 0;
}
