#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> F;
  int i = 2, counter = 0;
  while (n > 1) {
    while (n % i == 0) {
      n = n / i;
      F.push_back(i);
      counter++;
    }
    if (n % i != 0) {
      i++;
    }
  }
  if (counter < k) {
    cout << -1 << endl;
  } else {
    int i = 0;
    for (; i < k - 1; i++) {
      cout << F[i] << " ";
    }
    int last = 1;
    while (i < F.size()) {
      last *= F[i];
      i++;
    }
    cout << last << endl;
  }
  return 0;
}
