#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:20000007")
#pragma GCC optimize("unroll-loops")
const int N = (int)1e6 + 100;
const int maxn = (int)1e3 + 100;
const int base = (int)1e9;
const int mod = (int)1e9 + 7;
const int inf = INT_MAX;
const long long ll_inf = LLONG_MAX;
const long double pi = acos((long double)-1.0);
const long double eps = 1e-8;
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> ans;
  int par = k;
  for (int i = 2; i <= n; ++i) {
    while (k > 1 && n % i == 0) {
      n /= i;
      ans.push_back(i);
      --k;
    }
  }
  ans.push_back(n);
  if (ans.size() != par || find((ans).begin(), (ans).end(), 1) != ans.end()) {
    cout << -1 << endl;
    return;
  }
  for (int i : ans) cout << i << ' ';
}
int main() {
  int T = 1;
  for (; T; --T) solve();
  return 0;
}
