#include <bits/stdc++.h>
using namespace std;
long long const N = 320;
bool isPrime[N + 1];
vector<int> occurances;
vector<long long> prime_list, factor_list;
void sieve() {
  for (int i = 0; i <= N; i++) {
    isPrime[i] = true;
  }
  isPrime[0] = isPrime[1] = false;
  for (int i = 2; i * i <= N; i++) {
    if (isPrime[i] == true) {
      for (int j = i * i; j <= N; j += i) {
        isPrime[j] = false;
      }
    }
  }
  for (int i = 2; i <= N; i++) {
    if (isPrime[i] == true) prime_list.push_back(i);
  }
}
void prime_factorization(long long n) {
  for (int i = 0; i < prime_list.size(); i++) {
    long long x = prime_list[i];
    if ((long long)(x * x) > n) break;
    if (n % x == 0) {
      int occurance = 0;
      while (n % x == 0) {
        n /= x;
        occurance++;
      }
      factor_list.push_back(x);
      occurances.push_back(occurance);
    }
  }
  if (n > 1) {
    factor_list.push_back(n);
    occurances.push_back(1);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  sieve();
  int n, k, sum = 0;
  cin >> n >> k;
  prime_factorization(n);
  for (int i = 0; i < occurances.size(); i++) {
    sum += occurances[i];
  }
  if (sum < k) {
    cout << -1;
    return 0;
  } else {
    int i = 0;
    while (k > 1) {
      while (n % factor_list[i] == 0 && k > 1) {
        cout << factor_list[i] << " ";
        n /= factor_list[i];
        k--;
      }
      i++;
    }
    cout << n;
  }
  return 0;
}
