//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
//#pragma GCC optimize("Ofast","unroll-loops","inline")
#include<bits/stdc++.h>
#define ll long long
//#define int ll
#define pb push_back
#define pii pair<int,int>
#define MP make_pair
#define fi first
#define se second
using namespace std;
const int N=5e5+10,M=1e6+10,mod=998244353;
int s,x;
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>s>>x;
	int p=s-s%x;
	s%=x;
	if(!s){
		cout<<2<<'\n';
		cout<<1<<' ';
		cout<<p-1<<'\n';
		return 0;
	}
	int i,j;
	for(i=s,j=s;i!=x&&j!=0;i++,j--){
		if(__gcd(i,x)==1){
			cout<<abs(s-i)+1<<'\n';
			cout<<i+p<<' ';
			for(int k=1;k<=abs(s-i);k++) cout<<-1<<' ';cout<<'\n';
			return 0;
		}
		if(__gcd(j,x)==1){
			cout<<abs(s-j)+1<<'\n';
			cout<<j+p<<' ';
			for(int k=1;k<=abs(s-j);k++) cout<<1<<' ';cout<<'\n';
			return 0;
		}
	}
	if(i==x){
		cout<<abs(s-i)<<'\n';
		cout<<-1+x+p<<' ';
		for(int k=1;k<abs(s-i);k++) cout<<-1<<' ';cout<<'\n';
		return 0;
	}
	if(j==0){
		cout<<abs(s-j)<<'\n';
		cout<<1+p<<' ';
		for(int k=1;k<abs(s-j);k++) cout<<1<<' ';cout<<'\n';
		return 0;
	}
	return 0;
}