#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long ans[100010];
vector<long long> v;
vector<long long> adj[100010];
long long loc = 0;
void get(long long idx, long long k) {
  if (loc >= 100000) return;
  if (k == 0 || idx == 0) {
    loc++;
    cout << v[idx] << " ";
    return;
  }
  for (auto &i : adj[idx]) {
    get(i, k - 1);
    if (loc >= 100000) return;
  }
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      v.push_back(i);
      if (i * i != n) v.push_back(n / i);
    }
  }
  sort(v.begin(), v.end());
  n = v.size();
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j <= i; j++) {
      if (v[i] % v[j] == 0) {
        adj[i].push_back(j);
      }
    }
  }
  get(n - 1, k);
  return 0;
}
