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;
bool comp(int a, int b) { return a > b; }
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
int ch[6];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n, c = 0, a, b, t, lj = 0, k, r = 0, l = 0, sum = 0, d, rr,
               mn = INT_MAX, mx = INT_MIN;
  cin >> a >> k;
  n = a;
  c = pow(10, k);
  cout << lcm(a, c);
}
