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;
long long mod = 1e9;
long long MOD = 1e18 + 0LL;
int main() {
  int cs = 1;
  while (cs--) {
    long long n, k, ans;
    scanf("%I64d %I64d", &n, &k);
    ans = 1LL;
    long long ans2 = n;
    for (int i = 0; i < k; i++) ans = ans * 10LL;
    while (1) {
      if (ans2 % ans == 0LL) {
        cout << ans2;
        break;
      } else
        ans2 += n;
    }
  }
}
