#include <fstream>
#include <vector>
#include <algorithm>
#include <map>
#define pb push_back

using namespace std;

ifstream fin("desc.in");
ofstream fout("desc.out");

vector<long long> Div;
map<long long, int> mp;
int dp[3005][3005];

int main() {
	long long n,k,i,nrDiv,j,d;

    fin>>n>>k;

	for(i=1;i*i<n;++i) {
		if(n%i == 0) {
			Div.pb(i);
			Div.pb(n/i);
		}
	}

	if(i*i==n) Div.pb(i);

	sort(Div.begin(), Div.end());
	for(i=0;i<Div.size();++i) mp[Div[i]]=i;

	nrDiv=Div.size();
	for(i=1;i<nrDiv;++i) {
		dp[i][i]=1;

		for(j=i-1;j>0;--j) {
			if(Div[i]%Div[j] == 0 && Div[i]/Div[j]>=Div[j])
				dp[i][j]+=dp[mp[Div[i]/Div[j]]][j];

			dp[i][j]+=dp[i][j+1];
		}
	}

	fout<<dp[nrDiv-1][1]<<'\n';

	vector<int> rst;
	d=1;
	n=nrDiv-1;
	while(n>0) {
		while(k>dp[n][d]-dp[n][d+1]) {
			k-=dp[n][d]-dp[n][d+1];
			++d;
		}
		n=mp[Div[n]/Div[d]];
		rst.pb(Div[d]);
	}

	for(i=0;i<rst.size();++i) fout<<rst[i]<<' ';

    return 0;
}