#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
const int LIM = 100000;
vector<long long> ans;
map<long long, vector<long long> > factors;
void factor(long long n) {
  stack<long long> st;
  for (long long d = 1; d * d <= n; ++d) {
    if (n % d == 0) {
      factors[n].push_back(d);
      if (d * d != n) st.push(n / d);
    }
  }
  while (!st.empty()) {
    factors[n].push_back(st.top());
    st.pop();
  }
}
void go(long long n, int k) {
  if (n == 1) {
    ans.push_back(1);
    return;
  }
  if (k == 0) {
    ans.push_back(n);
    return;
  }
  if (factors.find(n) == factors.end()) factor(n);
  if (factors[n].size() == 2) {
    for (int a = 0; a < k && ans.size() < LIM; ++a) ans.push_back(1);
    if (ans.size() < LIM) ans.push_back(n);
    return;
  }
  for (long long f : factors[n]) {
    go(f, k - 1);
    if (ans.size() >= LIM) return;
  }
}
int main() {
  long long n, k;
  cin >> n >> k;
  k = min<long long>(k, LIM);
  go(n, k);
  for (long long x : ans) cout << x << " ";
  printf("\n");
  return 0;
}
