#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const long long INF = LLONG_MAX - 100;
const int mod = 998244353;
long long gcd(long long a, long long b);
long long power(long long x, long long y, long long m);
long long modInverse(long long a, long long m) {
  long long g = gcd(a, m);
  if (g != 1)
    cout << "Inverse doesn't exist";
  else {
    return power(a, m - 2, m);
  }
}
long long power(long long x, long long y, long long m) {
  if (y == 0) return 1;
  long long p = power(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long sorte(pair<pair<long long, long long>, long long> a,
                pair<pair<long long, long long>, long long> b) {
  if (a.first.first < b.first.first) return true;
  if (b.first.first < a.first.first) return false;
  if (a.first.second < b.first.second) return false;
  if (b.first.second < a.first.second) return true;
  ;
  return false;
}
signed main() {
  auto start = high_resolution_clock::now();
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  int count = k;
  vector<int> factors;
  for (int i = 2; i <= n && k > 1; i++) {
    if (n % i == 0) {
      n /= i;
      k--;
      factors.push_back(i);
      i--;
    }
  }
  if (n != 1) factors.push_back(n);
  if (factors.size() == count) {
    for (auto i : factors) cout << i << " ";
  } else {
    cout << -1;
  }
  auto stop = high_resolution_clock::now();
  auto duration = duration_cast<microseconds>(stop - start);
  cerr << endl
       << "Time in microseconds:" << duration.count() << endl
       << "Time in seconds:" << duration.count() / (1000000.0) << endl;
}
