#include <bits/stdc++.h>
using namespace std;
const int maxn = 7000;
const int inf = 1 << 29;
const int lim = 100000;
vector<int> v[maxn];
vector<long long> p;
int n;
void sol(int x, vector<int>& r, vector<int>& po) {
  if (x == 1) {
    for (int i = 0; i < n; i++) {
      r.push_back(i);
      po.push_back(i);
    }
    po.push_back(n);
    return;
  }
  if (x & 1) {
    vector<int> tr, tp;
    sol(x - 1, tr, tp);
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      int l = tp[i], ri = tp[i + 1];
      po.push_back(cnt);
      for (int j = l; j < ri && cnt < lim; j++) {
        int toit = tr[j];
        for (int k = 0; k < v[toit].size(); k++) {
          r.push_back(v[toit][k]);
          cnt++;
          if (cnt == lim) break;
        }
      }
    }
    po.push_back(cnt);
  } else {
    vector<int> tr, tp;
    sol(x / 2, tr, tp);
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      int l = tp[i], ri = tp[i + 1];
      po.push_back(cnt);
      for (int j = l; j < ri && cnt < lim; j++) {
        int toit = tr[j];
        for (int k = 0; k < v[toit].size() && cnt < lim; k++) {
          int now = v[toit][k], pl = tp[now], pr = tp[now + 1];
          for (; pl < pr; pl++) {
            r.push_back(tr[pl]);
            cnt++;
            if (cnt == lim) break;
          }
        }
      }
    }
    po.push_back(cnt);
  }
}
int main() {
  long long k, x;
  cin >> x >> k;
  k = min(k, 100000ll);
  if (k == 0) {
    cout << x << endl;
    return 0;
  }
  for (long long i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      p.push_back(i);
      if (i * i != x) p.push_back(x / i);
    }
  }
  sort(p.begin(), p.end());
  n = p.size();
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= i; j++) {
      if (p[i] % p[j] == 0) v[i].push_back(j);
    }
  vector<int> ra, rb;
  sol(k, ra, rb);
  for (int i = 0; i < ra.size(); i++) printf("%I64d ", p[ra[i]]);
}
