#include <bits/stdc++.h>
using namespace std;
void prime(int n);
int p[100000];
int fact[100000];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, div = 0;
  cin >> n >> k;
  fill(fact, fact + n, 1);
  prime(n);
  for (int i = 2, j = 0; i <= n; i++) {
    if (p[i] == -1) continue;
    while (n % i == 0) {
      if (j < k) {
        n /= i;
        fact[j++] *= i;
        div++;
      } else
        j = 0;
    }
  }
  if (div >= k) {
    for (int i = 0; i < k; i++) {
      cout << fact[i] << " ";
    }
    cout << '\n';
  } else
    cout << -1 << '\n';
  return 0;
}
void prime(int n) {
  for (long long i = 2; i < n; i++) {
    if (p[i]) continue;
    for (long long j = i * i; j < n; j += i) {
      p[j] = -1;
    }
  }
}
