#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;

mt19937 rng(time(NULL));

int mod=0;
int add(int a,int b){
    a+=b;
    if(a>=mod)
        a-=mod;
    return a;
}
int sub(int a,int b){
    a-=b;
    if(a<0)
        a+=mod;
    return a;
}
int mul(int a,int b){
    return (long long)a*b%mod;
}
int pwrmod(int x,int k){
    int ans=1;
    for(;k;k>>=1,x=mul(x,x))
        if(k&1)
            ans=mul(ans,x);
    return ans;
}
int main()
{
	int s,x;
	cin >> s >> x;
	if(__gcd(s,x)==1){
		printf("1\n%i\n",s);
		return 0;
	}
	vector<int> ps;
	int tr=x;
	for(int i=2;i*i<=tr;i++){
		if(tr%i==0){
			ps.pb(i);
			while(tr%i==0)tr/=i;
		}
	}
	if(tr!=1)ps.pb(tr);
	auto solve2=[&](){
		int a=0;
		int c=1;
		for(auto p:ps){
			int ost=s%p;
			ost=(p-ost)%p;
			int b=1;
			if((b+ost)%p==0){
				b++;
			}
			assert(b<p);
			mod=p;
			int treba=mul(sub(b,a),pwrmod(c,mod-2));
			a+=c*treba;
			c*=p;
		}
		assert(__gcd(a,x)==1);
		assert(__gcd(abs(a-s),x)==1);
		vector<int> ret={a,-(a-s)};
		return ret;
	};
	vector<int> ans;
	if(ps[0]==2&&(s%2!=0)){
		s--;
		ans=solve2();
		ans.pb(1);
	}
	else{
		ans=solve2();
	}
	printf("%i\n",sz(ans));
	for(auto p:ans)printf("%i ",p);
	printf("\n");
	return 0;
}