#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const long long mod = 1e9 + 7;
long long dy[4] = {1, 0, -1, 0};
long long dx[4] = {0, 1, 0, -1};
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class A, class B>
ostream& operator<<(ostream& ost, const pair<A, B>& p) {
  ost << "{" << p.first << ", " << p.second << "} ";
  return ost;
}
template <class T>
ostream& operator<<(ostream& ost, const vector<T>& v) {
  ost << "{";
  for (int i = 0; i < v.size(); i++) {
    if (i) ost << ", ";
    ost << v[i];
  }
  ost << "} ";
  return ost;
}
template <class A, class B>
ostream& operator<<(ostream& ost, const map<A, B>& v) {
  ost << "{";
  for (auto p : v) {
    ost << "{" << p.first << ", " << p.second << "} ";
  }
  ost << "} ";
  return ost;
}
bool out_check(long long a, long long b) { return (0 <= a && a < b); }
void addmod(long long& a, long long& b) { a = (a + b) % mod; }
double pitagoras(long long a, long long b, long long c, long long d) {
  double dx = a - b, dy = c - d;
  return pow(dx * dx + dy * dy, 0.5);
}
long long powmod(long long a, long long b) {
  long long c = 1;
  while (b > 0) {
    if (b & 1) {
      c = a * c % mod;
    }
    a = a * a % mod;
    b >>= 1;
  }
  return c;
}
void Yes(bool x) { cout << ((x) ? "Yes\n" : "No\n"); }
void YES(bool x) { cout << ((x) ? "YES\n" : "NO\n"); }
void yes(bool x) { cout << ((x) ? "yes\n" : "no\n"); }
void Yay(bool x) { cout << ((x) ? "Yay!\n" : ":(\n"); }
vector<string> DAY = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
long long n, m, d, e, r, l, k, h, Q, ans, ret = LLONG_MAX;
bool flag = false, flag2 = false, flag3 = false;
string s, t, u;
vector<long long> divisor(long long n) {
  vector<long long> w;
  for (long long i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      w.push_back(i);
      if (i * i != n) {
        w.push_back(n / i);
      }
    }
  }
  sort(w.begin(), w.end());
  return w;
}
vector<long long> rec;
map<long long, long long> ma;
vector<vector<long long> > num;
void calc(long long v, long long k) {
  if (k == 0) {
    if (rec.size() < 1e5) rec.emplace_back(v);
    return;
  }
  long long x = ma[v];
  for (auto N : num[x]) {
    if (rec.size() >= 1e5) return;
    if (N == 1)
      rec.emplace_back(1);
    else
      calc(N, k - 1);
  }
}
int main() {
  long long x;
  cin >> x >> k;
  if (x == 1) {
    puts("1");
    return 0;
  }
  if (k >= 1e5) {
    for (int i = 0; i < 1e5; ++i) cout << "1 ";
    puts("");
    return 0;
  }
  auto v = divisor(x);
  num.resize(v.size());
  for (int i = 0; i < v.size(); ++i) {
    ma[v[i]] = i;
    num[i] = divisor(v[i]);
  }
  calc(x, k);
  for (int i = 0; i < min((size_t)1e5, rec.size()); ++i) cout << rec[i] << " ";
  puts("");
}
