#include <bits/stdc++.h>
using namespace std;
int k1[100005];
int f(int x) {
  for (int i = 2; i <= x; i++)
    if (x % i == 0) return i;
}
int main() {
  int n, k, tot = 0;
  cin >> n >> k;
  while (tot != k - 1 && n != 1) {
    k1[tot] = f(n);
    n /= f(n);
    tot++;
  }
  if (tot == k - 1 && n != 1) {
    for (int i = 0; i < tot; i++) cout << k1[i] << " ";
    cout << n;
  } else {
    cout << -1;
  }
}
