#include <bits/stdc++.h>
using namespace std;
long done;
long long n, k;
set<long long> was;
map<long long, long> rem;
vector<set<long long> > v;
void add(long long x) {
  if (done) cout << " ";
  cout << x;
  ++done;
}
void solve(long long n, long long iter) {
  if (done == 100000) return;
  if (iter == 0) {
    add(n);
    return;
  }
  if (n == 1) {
    add(n);
    return;
  }
  set<long long> divs;
  set<long long>::iterator it;
  if (was.find(n) != was.end())
    divs = v[rem[n]];
  else {
    was.insert(n);
    rem[n] = was.size() - 1;
    for (long long i = 1; i * i <= n; i++)
      if (n % i == 0) {
        divs.insert(i);
        divs.insert(n / i);
      }
    v.push_back(divs);
  }
  for (it = divs.begin(); it != divs.end(); it++) {
    solve((*it), iter - 1);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  solve(n, k);
  cout << endl;
  cin.get();
  cin.get();
  return 0;
}
