#include<cstdio>
typedef long long ll;
inline ll read(){
	ll x=0;
	int f=0,ch=0;
	while(ch<48||ch>57) f=(ch=='-'),ch=getchar();
	while(ch>47&&ch<58) x=(x<<3)+(x<<1)+(ch&15),ch=getchar();
	return f?-x:x;
}
inline void write(ll x,char end=' '){
	if(x==0){
		putchar('0');
		putchar(end);
		return;
	}
	if(x<0) putchar('-'),x=-x;
	int ch[40]={0},cnt=0;
	while(x){
		ch[cnt++]=(int)(x%10);
		x/=10;
	}
	while(cnt--) putchar(ch[cnt]+48);
	putchar(end);
}
inline int min(int x,int y){return x<y?x:y;}
const int inf=1e9;
inline int gcd(int x,int y){
	if(x<0) x=-x;
	if(y<0) y=-y;
	return y==0?x:gcd(y,x%y);
}
int mn[1005],to[1005];
int main(){
	int s=read(),x=read();
	if(gcd(s,x)==1){
		printf("1\n%d\n",s);
		return 0;
	}
	if(gcd(s-1,x)==1){
		printf("2\n1 %d\n",s-1);
		return 0;
	}
	if(s+1<=inf&&gcd(s+1,x)==1){
		printf("2\n-1 %d\n",s+1);
		return 0;
	}
	mn[0]=0;
	to[0]=0;
	for(int i=1;i<=1000;++i){
		mn[i]=i;
		to[i]=i-1;
		for(int j=1;j<=i;++j){
			if(gcd(j,x)==1){
				if(mn[i-j]+1<mn[i]){
					mn[i]=mn[i-j]+1;
					to[i]=i-j;
				}
			}
		}
	}
	int mnpos=0,nowmn=s;
	for(int i=2;i<=1000;++i){
		if(gcd(s-i,x)==1){
			int need=mn[i]+1;
			if(need<nowmn){
				nowmn=need;
				mnpos=i;
			}
		}
		if(s+i<=inf&&gcd(s+i,x)==1){
			int need=mn[i]+1;
			if(need<nowmn){
				nowmn=need;
				mnpos=i;
			}
		}
	}
	printf("%d\n",nowmn);
	if(gcd(s-mnpos,x)==1){
		printf("%d ",s-mnpos);
		while(mnpos) write(mnpos-to[mnpos]),mnpos=to[mnpos];
	}
	else{
		printf("%d ",s+mnpos);
		while(mnpos) write(to[mnpos]-mnpos),mnpos=to[mnpos];
	}
	return 0;
}