#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
int ans[maxn];
int main() {
  int n, k, re;
  cin >> n >> k;
  re = n;
  int cnt = 0;
  for (int i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      n /= i;
      ans[cnt++] = i;
    }
  }
  if (n != 1) {
    ans[cnt++] = n;
  }
  if (cnt < k)
    cout << -1 << endl;
  else {
    long long s = 1;
    for (int i = 0; i <= cnt - k; i++) {
      s *= ans[i];
    }
    cout << s;
    for (int i = cnt - k + 1; i < cnt; i++) {
      cout << " " << ans[i];
    }
    cout << endl;
  }
  return 0;
}
