#include <cstdio>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <functional>
#include <string>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <bitset>
#include <stack>
#include <iomanip>
#define MOD 1000000000
#define NMAX 2005
#define INF 0x3f3f3f3f
#define pb push_back

using namespace std;

typedef pair<int, int> pii;

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

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

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

    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> restore;
	divizor=1;
	n=nrDiv-1;
	while(n>0) {
		while(k>dp[n][divizor]-dp[n][divizor+1]) {
			k-=dp[n][divizor]-dp[n][divizor+1];
			++divizor;
		}
		n=mp[Div[n]/Div[divizor]];
		restore.pb(Div[divizor]);
	}

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

    return 0;
}