#include <bits/stdc++.h>
using namespace std;
vector<long long int> v;
vector<pair<long long int, long long int> > pf;
bool mark[100005];
void Sieve(long long int n) {
  for (long long int i = 2; i * i <= n; i++) {
    if (mark[i] == false) {
      v.push_back(i);
      for (long long int j = i * i; j <= n; j += i) mark[j] = true;
    }
  }
}
void primeFact(long long int n) {
  for (long long int i = 0; i < v.size(); i++) {
    long long int cnt = 0;
    if (n % v[i] == 0) {
      while (n % v[i] == 0) {
        n /= v[i];
        cnt++;
      }
      if (cnt > 0) pf.push_back(make_pair(v[i], cnt));
    }
  }
  if (n > 1) pf.push_back(make_pair(n, 1));
}
int main() {
  long long int n, k;
  scanf("%lld%lld", &n, &k);
  Sieve(n);
  primeFact(n);
  long long int ans = 0;
  for (long long int i = 0; i < pf.size(); i++) ans += pf[i].second;
  if (ans < k)
    printf("-1\n");
  else {
    long long int ans = 0;
    vector<long long int> joss;
    long long int kop = 1;
    for (long long int i = 0; i < pf.size(); i++) {
      long long int loop = pf[i].second;
      while (loop != 0) {
        if (ans < k - 1) {
          ans++;
          joss.push_back(pf[i].first);
        } else {
          kop *= pf[i].first;
        }
        loop--;
      }
    }
    if (kop != 1) joss.push_back(kop);
    for (long long int i = 0; i < joss.size(); i++) cout << joss[i] << " ";
  }
}
