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;
int main() {
  long long n;
  int k;
  cin >> n;
  cin >> k;
  long long curans;
  if (k == 0 && n % 10 != 0) {
    cout << n << endl;
    return 0;
  }
  long long c = pow(10, k);
  if (c % 10 != 0) {
    c++;
  }
  if (n % c == 0) {
    cout << n << endl;
    return 0;
  }
  long long v = n;
  if (n % 5 == 0) {
    for (int i = 2; i <= 100000000; i += 2) {
      v = n * i;
      if (v % c == 0) {
        curans = v;
        break;
      }
    }
    for (int i = 5; i <= 1000000000; i += 5) {
      v = n * i;
      if (v % c == 0) {
        curans = min(curans, v);
        cout << curans << endl;
        return 0;
      }
    }
  } else if (n % 10 == 2) {
    for (int i = 5; i <= 100000000; i += 5) {
      v = n * i;
      if (v % c == 0) {
        cout << v << endl;
        return 0;
      }
    }
  } else if (n % 10 == 4) {
    for (int i = 5; i <= 100000000; i += 5) {
      v = n * i;
      if (v % c == 0) {
        cout << v << endl;
        return 0;
      }
    }
  } else if (n % 10 == 8) {
    for (int i = 5; i <= 100000000; i += 5) {
      v = n * i;
      if (v % c == 0) {
        cout << v << endl;
        return 0;
      }
    }
  } else if (n % 10 == 6) {
    for (int i = 5; i <= 100000000; i += 5) {
      v = n * i;
      if (v % c == 0) {
        cout << v << endl;
        return 0;
      }
    }
  } else {
    cout << n * c << endl;
    return 0;
  }
}
