#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
const int nmax=4005;
const int mod=99017;
vector< pair <long long,int> > h[mod+5];
vector<long long> ans;
int modes[nmax][nmax],sum[nmax],tot;
long long v[nmax];
long long curr,key,cost,i,d,j,n,k,lst,prod,newd;
bool ok;
void inserts(long long x)
{
    key=x%mod;
    h[key].push_back(make_pair(x,i));
}
int finds(long long x)
{
    key=x%mod;
    for(int it=0;it<h[key].size();it++)
        if(h[key][it].first==x) return h[key][it].second;
    return d+1;
}
int main()
{
    ifstream f("desc.in");
    ofstream g("desc.out");
    f>>n>>k;
    for(i=2;i*i<=n;i++)
    {
        if(n%i==0)
        {
        d++;
        v[d]=i;
        }
    }
    for(i=d;i>=1;i--)
    {
        if((n/v[i])!=v[i])
        {newd++;v[d+newd]=n/v[i];}
    }
    d+=newd;
    d++;
    v[d]=n;
    for(i=1;i<=d;i++)
        inserts(v[i]);
    for(i=1;i<=d;i++)
        modes[i][i]=1;
    for(i=d;i>=1;i--)
        for(j=1;j<=d;j++)
    {
       if(v[j]%v[i]==0)
        {
            modes[i][j]+=sum[finds(v[j]/v[i])];
        }
        sum[j]=sum[j]+modes[i][j];
    }
    for(i=1;i<=d;i++)
        tot+=modes[i][d];
    lst=0;v[0]=1;prod=n;
    while(prod!=1)
    {
        prod/=v[lst];curr=finds(prod);ok=0;
        ans.push_back(v[lst]);
        if(prod==1) break;
        if(lst==0) lst=1;
        for(i=lst;i<=d&&ok==0;i++)
        {
            if(prod%v[i]==0)
            {
                if(cost+modes[i][curr]>=k)
                {
                    ok=1;lst=i;
                }else cost+=modes[i][curr];
            }
        }
    }
    g<<tot<<'\n';
    for(i=1;i<ans.size();i++)
        g<<ans[i]<<' ';
    return 0;
}