#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
const int MOD = 1000000007;
vector<long long> divisors[MAXN];
long long cnt, p;
map<long long, int> mp;
void fun(long long a, long long b) {
  if (a == 1) {
    cout << "1 ";
    cnt++;
    if (cnt == 100000) exit(0);
    return;
  }
  if (b == 0) {
    cout << a << ' ';
    cnt++;
    if (cnt == 100000) exit(0);
    return;
  }
  if (mp.count(a) == 0) {
    mp[a] = ++p;
    for (long long i = 1; i * i <= a; i++) {
      if (a % i == 0) {
        divisors[p].push_back(i);
        if (i * i != a) divisors[p].push_back(a / i);
      }
    }
    sort(divisors[p].begin(), divisors[p].end());
  }
  int cur = mp[a];
  for (long long i : divisors[cur]) {
    fun(i, b - 1);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long x, k;
  cin >> x >> k;
  if (k >= 100000 && x != 1) {
    for (int i = 0; i < 100000; i++) cout << "1 ";
    cout << '\n';
    return 0;
  }
  fun(x, k);
  cout << '\n';
  return 0;
}
