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 ispalindrome(string str) {
  int len = str.length();
  for (int i = 0; i < len / 2; i++) {
    if (str[i] != str[len - i - 1]) return false;
  }
  return true;
}
bool allsame(string str) {
  char c = str[0];
  for (int i = 1; i < str.length(); i++) {
    if (c != str[i]) return false;
  }
  return true;
}
int main() {
  long long int n, k;
  cin >> n >> k;
  long long int c1 = n, cnt5 = 0, cnt2 = 0;
  while (c1 % 5 == 0) {
    c1 /= 5;
    cnt5++;
  }
  while (c1 % 2 == 0) {
    c1 /= 2;
    cnt2++;
  }
  if (min(cnt5, cnt2) < k) {
    if (k > cnt2) n *= pow(2, k - cnt2);
    if (k > cnt5) n *= pow(5, k - cnt5);
  }
  cout << n;
}
