#include <bits/stdc++.h>
using namespace std;
bool isprime(long long int n) {
  if (n == 2 || n == 3)
    return true;
  else if (n % 2 == 0 || n % 3 == 0)
    return false;
  else if (n < 2)
    return false;
  else {
    int t = sqrt(n), k = 1;
    do {
      if (n % (6 * k - 1) == 0 || n % (6 * k + 1) == 0) break;
      k++;
    } while (6 * k - 1 <= t);
    return (6 * k - 1 > t);
  }
}
long long int prime[200000];
long long int c[5000000];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long int n, k;
  cin >> n >> k;
  if (k == 0)
    cout << n;
  else {
    long long int t = n, p = 0, q = 0;
    if (t % 2 == 0)
      while (t % 2 == 0) {
        t /= 2;
        q++;
      }
    if (t % 5 == 0)
      while (t % 5 == 0) {
        t /= 5;
        p++;
      }
    if (p > k)
      p -= k;
    else
      p = 0;
    if (q > k)
      q -= k;
    else
      q = 0;
    long long int ans = pow(10, k) * t * pow(5, p) * pow(2, q);
    cout << ans;
  }
  return 0;
}
