#include <bits/stdc++.h>
using namespace std;
vector<int> s;
int main() {
  long n;
  int k;
  cin >> n;
  cin >> k;
  int k2 = k;
  int sochiahet = 2;
  while (n && k > 0) {
    if (sochiahet > n) break;
    if (!(n % sochiahet)) {
      s.push_back(sochiahet);
      k--;
      n /= sochiahet;
    } else {
      sochiahet++;
    }
  }
  if (k) {
    cout << -1;
  } else {
    for (int i = 0; i < k2 - 1; i++) {
      cout << s[i] << " ";
    }
    cout << s[k2 - 1] * n;
  }
  return 0;
}
