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 int MAX = 1e6 + 10;
const int INF = 0x3fffffff;
long long Gcd(long long a, long long b) { return (b == 0) ? a : Gcd(b, a % b); }
int main() {
  long long n, k;
  while (scanf("%lld%lld", &n, &k) != EOF) {
    long long t = 1;
    for (int i = 0; i < k; i++) t *= 10;
    printf("%lld\n", n * t / Gcd(t, n));
  }
  return 0;
}
