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;
unsigned long long readUInt() {
  char c = 'a';
  while ((c < '0' || c > '9') && c != EOF) {
    c = getc(stdin);
  }
  unsigned long long x = 0;
  while ('0' <= c && c <= '9') {
    x = x * 10ull + c - '0';
    c = getc(stdin);
  }
  return x;
}
int main() {
  unsigned long long n = readUInt(), k = readUInt(), five = 0, two = 0, x = n;
  while (n % 5 == 0) {
    five++;
    n /= 5;
  }
  while (n % 2 == 0) {
    two++;
    n /= 2;
  }
  while (two < k) {
    x *= 2;
    two++;
  }
  while (five < k) {
    x *= 5;
    five++;
  }
  cout << x;
}
