#include <bits/stdc++.h>
const int pi = acos(-1);
using namespace std;
int n, k, j = 2;
vector<int> v;
long long sum = 1;
int main() {
  cin >> n >> k;
  while (n != 1) {
    if (n % j == 0) {
      v.push_back(j);
      n /= j;
    } else
      j++;
  }
  if (v.size() < k) {
    puts("-1");
    return 0;
  }
  for (int i = 0; i < k - 1; i++) cout << v[i] << " ";
  for (int i = k - 1; i < v.size(); i++) sum *= v[i];
  cout << sum;
  return 0;
}
