#include <bits/stdc++.h>
using namespace std;
const int Maxn = 32768;
int ans[Maxn], t[Maxn];
long long Gcd(long long x, long long y) { return y ? Gcd(y, x % y) : x; }
int main() {
  long long n, k, k_r;
  while (~scanf("%lld %lld", &n, &k)) {
    int t = 1;
    for (int i = 1; i <= k; i++) t *= 10;
    if (n > t)
      k_r = t * n / Gcd(n, t);
    else
      k_r = t * n / Gcd(t, n);
    printf("%lld\n", k_r);
  }
  return 0;
}
