#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
#define MOD 666013
#define MAXN 1000

#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
    if(pbuf==BUF_SIZE){
        fread(buf, BUF_SIZE, 1, fi);
        pbuf=0;
    }
    return buf[pbuf++];
}
inline long long nextnum(){
    long long a=0;
    char c=nextch();
    while((c<'0' || c>'9') && c!='-')
        c=nextch();
    int semn=1;
    if(c=='-'){
        semn=-1;
        c=nextch();
    }
    while('0'<=c && c<='9'){
        a=a*10+c-'0';
        c=nextch();
    }
    return a*semn;
}
class Hash{
    public:
    long long k=0, next[MAXN+1], *lista;
    long long val[MAXN+1];
    long long d[MAXN+1];
    Hash() {
        lista = new long long[MOD];
        memset(lista, 0x00, MOD*sizeof(int));
    }
    inline void insert(long long element, long long frecventa){
        k++;
        val[k]=element;
        d[k]=frecventa;
        next[k]=lista[(1LL*element+1LL*MOD*MOD)%MOD];
        lista[(1LL*element+1LL*MOD*MOD)%MOD]=k;
    }
    inline void erase(long long element){
        long long p=lista[(1LL*element+1LL*MOD*MOD)%MOD];
        if(p==0)
            return ;
        if(val[p]==element){
            lista[(1LL*element+1LL*MOD*MOD)%MOD]=next[lista[(1LL*element+1LL*MOD*MOD)%MOD]];
            return ;
        }
        while(next[p]!=0 && val[next[p]]!=element)
            p=next[p];
        if(next[p]!=0){
            next[p]=next[next[p]];
        }
    }
    inline long long find(long long element){
        long long p=lista[(1LL*element+1LL*MOD*MOD)%MOD];
        while(p!=0 && val[p]!=element)
            p=next[p];
        return p;
    }
} H;

int d[MAXN+1][MAXN+1];
int main(){
    fi=fopen("desc.in","r");
    fo=fopen("desc.out","w");
    long long n=nextnum(), k=nextnum();
    long long i=2;
    while(i*i<=n){
        if(n%i==0)
            H.insert(i, 1);
        i++;
    }
    while(i*i>=n)
        i--;
    while(i>0){
        if(n%i==0)
            H.insert(n/i, 1);
        i--;
    }
    for(int i=1;i<=H.k;i++){
        d[i][i]=1;
        for(int j=i-1;j>=1;j--){
            d[i][j]=d[i][j+1];
            if(H.val[i]%H.val[j]==0)
                d[i][j]+=d[H.find(H.val[i]/H.val[j])][j];
        }
    }
    fprintf(fo,"%d\n", d[H.k][1]);
    int ind=H.k;
    int mindiv=1;
    while(ind>0){
        while(k>d[ind][mindiv]-d[ind][mindiv+1]){
            k-=(d[ind][mindiv]-d[ind][mindiv+1]);
            mindiv++;
        }
        fprintf(fo,"%lld ", H.val[mindiv]);
        ind=H.find(H.val[ind]/H.val[mindiv]);
    }
    fclose(fi);
    fclose(fo);
    return 0;
}