#include <bits/stdc++.h>

#define task "desc"
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define PR(A, l, r) { cerr << '\n'; rep(_, l, r) DB1(A, _); cerr << '\n';}
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define pf push_front
#define F first
#define S second
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; } // sort(arr, arr + N, by(a));
#define next ___next
#define prev ___prev
#define y1 ___y1
#define left ___left
#define right ___right
#define y0 ___y0
#define div ___div
#define j0 ___j0
#define jn ___jn

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
const int INF = 1e9 + 1;
ll n;
int K, dp[5000][5000];
map<ll, int> pos;
vl f, ans;
int main()
{
    freopen(task".in", "r", stdin);
    freopen(task".out", "w", stdout);
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> n >> K;
    rep(i, 2, sqrt(n)) if (n % i == 0)
    {
        f.eb(i);
        if (i != n / i) f.eb(n / i);
    }
    sort(all(f));
    f.eb(n);
    int nn = SZ(f);
    rep(i, 0, nn - 1) pos[f[i]] = i;
    pos[1] = nn;
    rep(j, 0, nn) dp[nn][j] = 1;
    dp[nn - 1][nn - 1] = 1;
    Rep(j, nn - 2, 0) rep(i, j, nn - 1)
    {
        dp[i][j] = dp[i][j + 1];
        if (f[i] % f[j] == 0) dp[i][j] = min(INF, dp[i][j] + dp[pos[f[i] / f[j]]][j]);
    }
    //PR(f, 0, nn - 1);
    int lst = 0;
    while (n > 1)
    {
        rep(i, lst, nn - 1) if (n % f[i] == 0)
        {
            ll left = n / f[i];
            if (dp[pos[left]][i] < K) K -= dp[pos[left]][i];
            else
            {
                lst = i;
                n = left;
                ans.eb(f[i]);
                break;
            }
        }
    }
    cout << dp[nn - 1][0] << '\n';
    for (int v : ans) cout << v << ' ';
    return 0;
}