#include <bits/stdc++.h>
using namespace std;
int maxn = 100 * 1000;
vector<long long> ans;
vector<long long> div1;
vector<long long> div2[2 * 100 * 1000 * 10 + 100];
long long sz = 0;
void f(long long n, long long k, vector<long long> &v);
int main() {
  ios ::sync_with_stdio(false);
  ;
  cin.tie(0);
  long long n, k;
  cin >> n >> k;
  for (long long i = 1; i * i <= n; i++)
    if (n % i == 0) {
      div1.push_back(i);
      div1.push_back(n / i);
    }
  sort(div1.begin(), div1.end());
  div1.resize(unique(div1.begin(), div1.end()) - div1.begin());
  for (long long i = 0; i < div1.size(); i++) {
    long long tmp = div1[i];
    for (long long j = 1; j * j <= tmp; j++)
      if (tmp % j == 0) {
        div2[i].push_back(j);
        div2[i].push_back(tmp / j);
      }
    sort(div2[i].begin(), div2[i].end());
    div2[i].resize(unique(div2[i].begin(), div2[i].end()) - div2[i].begin());
  }
  f(n, k, ans);
  for (long long i = 0; i < min((int)ans.size(), maxn); i++)
    cout << ans[i] << " ";
  return 0;
}
void f(long long n, long long k, vector<long long> &v) {
  if (v.size() >= maxn) return;
  if (k == 0 || n == 1) {
    v.push_back(n);
    return;
  }
  int ind = lower_bound(div1.begin(), div1.end(), n) - div1.begin();
  for (int i = 0; i < div2[ind].size(); i++) {
    f(div2[ind][i], k - 1, v);
    if (v.size() >= maxn) return;
  }
}
