#include <bits/stdc++.h>
using namespace std;
long long GCD(long long n1, long long n2) {
  if (n2 != 0)
    return GCD(n2, n1 % n2);
  else
    return n1;
}
long long LCM(long long n1, long long n2) {
  long long m;
  m = n1 * n2 / GCD(n1, n2);
  return m;
}
unsigned long long choose(unsigned long long n, unsigned long long k) {
  if (k > n) {
    return 0;
  }
  unsigned long long r = 1;
  for (unsigned long long d = 1; d <= k; ++d) {
    r *= n--;
    r /= d;
  }
  return r;
}
bool isprime(int x) {
  if (x == 1) return 0;
  for (int i = 2; i * i < x; i++) {
    if (x % i == 0) return 0;
  }
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int c = 0, n, a, m;
  cin >> n >> a;
  m = n;
  for (int i = 2; i <= n; i++) {
    while (n % i == 0) {
      c++;
      n /= i;
    }
  }
  if (n > 1) c++;
  if (c >= a) {
    int d = 0;
    for (int i = 2; i <= m; i++) {
      if (d == a - 1) break;
      while (m % i == 0) {
        cout << i << " ";
        d++;
        m /= i;
        if (d == a - 1) break;
      }
      if (d == a - 1) break;
    }
    cout << m << endl;
  } else
    cout << -1 << endl;
  return 0;
}
