#include <bits/stdc++.h>
using namespace std;
int static fast = []() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  return 0;
}();
int main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> fac = {2, 5};
  vector<long long> prime = {0, 0};
  for (int i = 0; i < fac.size(); i++) {
    while (n % fac[i] == 0) {
      prime[i] += 1;
      n /= fac[i];
    }
    prime[i] = max(prime[i], k);
    while (prime[i]-- > 0) n *= fac[i];
  }
  cout << n << "\n";
  return 0;
}
