#include<iostream>
#include<cstdio>
#include<cstdint>
#include<vector>
#include<string>
#include<iosfwd>
#include<algorithm>
#include<random>
#define N 3000
#define __builtin_ia32_adc(x,y,flag) __asm__("addb   %3, %0\n\t" "adcq   %2, %1\n\t" "setc   %0":"+r"(flag),"+r"(x):"r"(y),"i"(-1):"cc")
using namespace std;
mt19937 RAND(random_device{}());
struct bigint{
    typedef unsigned long long u64;
    typedef unsigned __int128 u128;
    typedef std::size_t st;
    std::vector<u64> data;
    bigint(){}
    bigint(u64 x):data(x?std::vector<u64>{x}:std::vector<u64>{}){}
    bigint(const std::string &s){
        st pos=s.length();
        int cnt=0;
        u64 val=0;
        while(pos){
            pos--;
            if(cnt==64){
                data.push_back(val);
                val=0;cnt=0;
            }
            val|=(u64)(s[pos]=='1')<<cnt;
            ++cnt;
        }
        if(cnt&&val)data.push_back(val);
    }
    explicit operator std::string()const{
        if(data.empty())return "0";
        bool t=0;
        std::string ret;
        for(int i=63;i>=0;i--){
            t|=(data.back()>>i)&1;
            if(t)ret+='0'|((data.back()>>i)&1);
        }
        st i=data.size()-1;
        while(i){
            i--;
            for(int j=63;j>=0;j--)ret+='0'|((data[i]>>j)&1);
        }
        return ret;
    }
    explicit operator bool()const{return !data.empty();}
    explicit operator u64()const{return data.empty()?0:data[0];}
    st digit()const{
        if(data.empty())return 0;
        return (data.size()<<6)-__builtin_clzll(data.back());
    }
    bool operator==(const bigint &a)const{return a.data==data;}
    bool operator!=(const bigint &a)const{return a.data!=data;}
    bool operator<(const bigint &a)const{
        if(data.size()!=a.data.size())return data.size()<a.data.size();
        for(st i=data.size();i;){
            i--;
            if(data[i]!=a.data[i])return data[i]<a.data[i];
        }
        return 0;
    }
    bool operator>(const bigint &a)const{return a<(*this);}
    bool operator<=(const bigint &a)const{return !(*this>a);}
    bool operator>=(const bigint &a)const{return !(*this<a);}
    bigint &operator<<=(st n){
        if(data.empty())return *this;
        int w=n&63;st z=n>>6;
        st i=data.size();
        bool flg=0;
        if(w&&(data.back()>>(64-w)))data.push_back(0),flg=1;
        data.resize(data.size()+z);
        while(i){
            i--;
            if(flg)data[i+z+1]|=data[i]>>(64-w);
            data[i+z]=data[i]<<w;
            flg|=bool(w);
        }
        for(st i=0;i<z;i++)data[i]=0;
        return *this;
    }
    bigint &operator>>=(st n){
        int w=n&63;st z=n>>6,i=0;
        for(;i+z<data.size();i++){
            if(w&&i)data[i-1]|=data[i+z]<<(64-w);
            data[i]=data[i+z]>>w;
        }
        while(data.size()>i)data.pop_back();
        while(!data.empty()&&data.back()==0)data.pop_back();
        return *this;
    }
    bigint operator<<(st n)const{return bigint(*this)<<=n;}
    bigint operator>>(st n)const{return bigint(*this)>>=n;}
    bigint &operator+=(const bigint &a){
        data.resize(std::max(data.size(),a.data.size()));
        bool carry=0;
        for(st i=0;i<data.size();i++){
            u64 rg=0;
            if(i<a.data.size())rg=a.data[i];
            __builtin_ia32_adc(data[i],rg,carry);
        }
        if(carry)data.push_back(1);
        return *this;
    }
    bigint &operator-=(const bigint &a){
        bool carry=1;
        for(st i=0;i<data.size();i++){
            u64 rg=-1;
            if(i<a.data.size())rg=~a.data[i];
            __builtin_ia32_adc(data[i],rg,carry);
        }
        while(!data.empty()&&data.back()==0)data.pop_back();
        return *this;
    }
    bigint &operator++(){return *this+=bigint(1);}
    bigint &operator--(){return *this-=bigint(1);}
    bigint operator++(int){bigint tmp=*this;++*this;return tmp;}
    bigint operator--(int){bigint tmp=*this;--*this;return tmp;}
    bigint &operator*=(const bigint &a){
        std::vector<u64> ret(data.size()+a.data.size());
        for(st i=0;i<data.size();i++){
            u64 carry=0;bool wcarry=0;
            st k=i;
            for(st j=0;j<a.data.size();j++,k++){
                u128 r=data[i]*(u128)a.data[j]+carry;
                u64 cur=r;
                carry=r>>64;
                __builtin_ia32_adc(ret[k],cur,wcarry);
            }
            while(carry||wcarry){
                __builtin_ia32_adc(ret[k],carry,wcarry);
                carry=0;k++;
            }
        }
        while(!ret.empty()&&ret.back()==0)ret.pop_back();
        data=ret;
        return *this;
    }
    bigint &operator/=(const bigint &a){
        if(a.digit()>digit()){
            data.clear();
            return *this;
        }
        st z=digit()-a.digit();
        std::vector<u64> ret;
        while(1){
            bigint tmp=a<<z;
            if(tmp<=*this){
                *this-=tmp;
                st v1=z>>6;
                if(ret.size()<=v1)ret.resize(v1+1);
                ret[v1]|=(u64)(1)<<(z&63);
            }
            if(!z)break;
            z--;
        }
        data=ret;
        return *this;
    }
    bigint &operator%=(const bigint &a){
        if(a.digit()>digit())return *this;
        st z=digit()-a.digit();
        while(1){
            bigint tmp=a<<z;
            if(tmp<=*this)*this-=tmp;
            if(!z)break;
            z--;
        }
        return *this;
    }
    bigint operator+(const bigint &a)const{return bigint(*this)+=a;}
    bigint operator-(const bigint &a)const{return bigint(*this)-=a;}
    bigint operator*(const bigint &a)const{return bigint(*this)*=a;}
    bigint operator/(const bigint &a)const{return bigint(*this)/=a;}
    bigint operator%(const bigint &a)const{return bigint(*this)%=a;}
};
std::istream &operator>>(std::istream &st,bigint &a){
    std::string s;st>>s;a=bigint(s);return st;
}
std::ostream &operator<<(std::ostream &st,const bigint &a){
    return st<<(std::string)(a);
}
bigint n,phin,phint,m,p,pw2[N+1],tong[N+1],st[N+1];
bool nprime[N+1];
int sz,length,leng,cnt;
bigint gcd(bigint a,bigint b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}
bigint MD(bigint x)
{
	bigint r=x-((x*m)>>(sz<<1))*p;
	if (r>=p) r-=p;
	return r;
}
bigint fast_pow(bigint a,bigint b)
{
	bigint res=1,mul=a;
	while (b!=0)
	{
		if (((b>>1)<<1)!=b) res=MD(res*mul);
		mul=MD(mul*mul),b>>=1;
	}
	return res;
}
bigint get_pow(bigint a,int b)
{
	bigint res=1,mul=a;
	while (b)
	{
		if (b&1) res=res*mul;
		mul=mul*mul,b>>=1;
	}
	return res;
}
bigint get_sqt(bigint a,int b,int c)
{
	bigint res=0;
	for (int i=c;i>=0;--i)
		if (get_pow(res+pw2[i],b)<=a)
			res=res+pw2[i];
	return res;
}
void solve(bigint x)
{
	if (x==1) return;
	bigint a,b,g,d,ds;
	sz=x.digit(),p=x,m=pw2[sz<<1]/p;
	for (int i=1;i<=10;++i)
	{
		a=(bigint)(RAND())%x,d=fast_pow(a,x-1);
		if (d!=1) break;
		if (i==10)
		{
			tong[++length]=x;
			return;
		}
	}
	for (int i=1;i<=10;++i)
	{
		a=(bigint)(RAND())%x,g=gcd(a,x);
		if (g==x) continue;
		if (g!=1)
		{
			solve(g),solve(x/g);
			return;
		}
		d=fast_pow(a,phint);
		if (d!=1)
		{
			for (int j=0;j<=cnt;++j)
			{
				if (d+1==x) break;
				ds=MD(d*d);
				if (ds==1)
				{
					g=gcd(d+1,x),solve(g),solve(x/g);
					return;
				}
				d=ds;
			}
		}
	}
	for (int i=sz;i>=1;--i)
	{
		bigint res=get_sqt(x,i,sz/i);
		if (get_pow(res,i)==x)
		{
			for (int j=1;j<=i;++j) tong[++length]=res;
			return;
		}
	}
	return;
}
int main()
{
	pw2[0]=1;
	for (int i=1;i<=N;++i) pw2[i]=pw2[i-1]*2;
	for (int i=2;i<=N;++i)
		if (!nprime[i])
		{
			st[++leng]=(bigint)(i);
			for (int j=(i<<1);j<=N;j+=i) nprime[j]=1;
		}
	cin>>n>>phin,phint=phin;
	while (((phint>>1)<<1)==phint) phint>>=1,cnt++;
	for (int i=1;i<=leng;++i)
		while (n%st[i]==0)
			n/=st[i],tong[++length]=st[i];
	solve(n),printf("%d\n",length),sort(tong+1,tong+length+1);
	for (int i=1;i<=length;++i) cout<<tong[i]<<endl;
	return 0;
}