#include <bits/stdc++.h>
using namespace std;

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1LL)

using ll = long long;

const int mxn = 9 + 1e6;
const int inf = 0x3f3f3f3f;
const ll lnf = 0x3f3f3f3f3f3f3f3f;

namespace std {
  template <int D, typename T> struct Vec : public vector<Vec<D - 1, T>> {
    static_assert(D >= 1, "Dimension must be positive");
    template <typename... Args>
    Vec(int n = 0, Args... args) : vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {}
  };
  
  template <typename T> struct Vec<1, T> : public vector<T> {
    Vec(int n = 0, T val = T()) : std::vector<T>(n, val) {}
  };
}

void _27augain(void) {
  ll n;
  int k;
  cin >> n >> k;
  Vec<1, ll> d;
  for (ll i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      d.push_back(i);
      if (i * i ^ n) {
        d.push_back(n / i);
      }
    }
  }
  sort(begin(d), end(d));
  unordered_map<ll, int> mp;
  mp.reserve(1024);
  mp.max_load_factor(0.25);
  for (int i = 0; i < (int) (d.size()); ++i) {
    mp[d[i]] = i;
  }
  Vec<2, ll> dp((int) (d.size()), (int) (d.size()));
  for (int i = 0; i < (int) (d.size()); ++i) {
    dp[0][i] = 1;
  }
  for (int i = 1; i < (int) (d.size()); ++i) {
    for (int j = i; j > 0; --j) {
      if (d[i] % d[j] == 0) {
        dp[i][j] += dp[mp[d[i] / d[j]]][j];
      }
      dp[i][j - 1] += dp[i][j];
    }
  }
  cout << dp[(int) (d.size()) - 1][0] << "\n";
  int mn = 1;
  while (n > 1) {
    int sum = 0, prev = 0;
    for (int j = mn; j + 1 < (int) (d.size()); ++j) {
      sum += dp[mp[n]][j] - dp[mp[n]][j + 1];
      if (sum >= k) {
        mn = j;
        cout << d[j] << " ";
        k -= prev;
        n /= d[j];
        break;
      }
      prev = sum;
    }
  }
}

int32_t main(void) {
#define task "desc"
  cin.tie(0)->sync_with_stdio(0);
  for (string iext : {"in", "inp"}) {
    if (fopen((task "." + iext).c_str(), "r")) {
      freopen((task "." + iext).c_str(), "r", stdin);
      freopen(task ".out", "w", stdout);
    }
  }
  int testcase = 1;
  // cin >> testcase;
  while (testcase--) {
    _27augain();
  }
  return 0;
}