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;
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:268435456")
int main() {
  long long int n;
  long long int k;
  cin >> n >> k;
  long long int z = 0;
  while (1) {
    if (z >= k) break;
    while (n % 10 == 0) {
      n /= 10;
      ++z;
    }
    if (z >= k) break;
    if (n % 5 == 0) {
      n *= 2;
      continue;
    }
    if (n % 2 == 0) {
      n *= 5;
    } else
      break;
  }
  int u = k - z;
  if (u >= 0) {
    n *= pow(10, k);
    cout << n;
  } else {
    n *= pow(10, z);
    cout << n;
  }
  return 0;
}
