#include <bits/stdc++.h>
using namespace std;
int N, K;
int findDivisor(int n) {
  if (n % 2 == 0) return 2;
  for (int i = 3; i <= n; i += 2) {
    if (n % i == 0) return i;
  }
  return -1;
}
int main() {
  scanf("%d %d", &N, &K);
  vector<int> res;
  while (--K > 0) {
    int div = findDivisor(N);
    if (div == -1) {
      printf("-1");
      return 0;
    }
    N /= div;
    res.push_back(div);
  }
  if (N == 1) {
    printf("-1");
    return 0;
  }
  res.push_back(N);
  for (auto x : res) {
    printf("%d ", x);
  }
  return 0;
}
