#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
int main() {
  long long n, k, m, z = 0, g;
  cin >> n >> k;
  m = n;
  while (m and m % 10 == 0) {
    z++;
    m /= 10;
  }
  if (z >= k) {
    cout << n;
  } else {
    m = 1;
    while (k--) {
      m *= 10;
    }
    g = gcd(max(n, m), min(n, m));
    cout << (n / g) * m;
  }
}
