#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
const int INF = 0x3f3f3f3f;
long long ans[N + 10];
long long p[N];
int tot, num;
long long x, K;
void getfactor() {
  int s = sqrt(x + 1e-8);
  tot = 0;
  for (int i = 1; i <= s; i++)
    if (x % i == 0) {
      p[tot++] = i;
      if ((long long)i * i != x) p[tot++] = x / i;
    }
  sort(p, p + tot);
}
void dfs(long long cur, int k) {
  if (num >= N) return;
  if (k == K) {
    ans[num++] = cur;
    return;
  }
  if (cur == 1) {
    ans[num++] = cur;
    return;
  }
  for (int i = 0; i < tot && p[i] <= cur; i++)
    if (cur % p[i] == 0) dfs(p[i], k + 1);
}
void solve() {
  getfactor();
  num = 0;
  dfs(x, 0);
}
void work() {
  while (~scanf("%I64d%I64d", &x, &K)) {
    if (x == 1) {
      printf("1\n");
      continue;
    }
    if (K >= N) {
      for (int i = 0; i < N; i++) {
        if (i == N - 1)
          printf("1\n");
        else
          printf("1 ");
      }
      continue;
    }
    solve();
    for (int i = 0; i < num; i++) {
      if (i == num - 1)
        printf("%I64d\n", ans[i]);
      else
        printf("%I64d ", ans[i]);
    }
  }
}
int main() {
  work();
  return 0;
}
