#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
long long int fexpo(long long int a, long long int b) {
  if (b == 0) return 1LL;
  if (b == 1) return a;
  if (b == 2) return a * a;
  if (b % 2 == 0)
    return fexpo(fexpo(a, b / 2), 2);
  else
    return a * fexpo(fexpo(a, (b - 1) / 2), 2);
}
int main() {
  long long int n;
  cin >> n;
  long long int k;
  cin >> k;
  vector<long long int> s;
  for (long long int i = 2; i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) {
        s.push_back(i);
        n = n / i;
      }
    }
  }
  int le = s.size();
  if (le >= k) {
    int i;
    for (i = 0; i < k - 1; i++) {
      cout << s[i] << " ";
    }
    long long int h = 1;
    for (int i = k - 1; i < le; i++) {
      h = h * s[i];
    }
    cout << h << endl;
  } else {
    cout << -1 << endl;
  }
  return 0;
}
