#include <bits/stdc++.h>   using namespace std;   int main() {     int n, k, i = 0, d = 2;     cin >> n >> k;     vector<int> v;     while (i < k - 1 && n != 1) {       if (n % d == 0) {         n /= d;         v.push_back(d);         i++;       } else {         d++;       }     }     if (n != 1) v.push_back(n);     if (k != v.size())       cout <<  -1 ;     else {       for (int i = 0; i < k; i++) cout << v[i] << endl;     }   }   