#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 1e5 + 3;
typedef long long ll;

void work(){
	int n,m;cin >> n >> m;
	vector <int> ans,r,a;
	if(n % 2 && m % 2 == 0) {
		ans.push_back(1);
		n -= 1;
	}
	for(int i = 2;i * i <= m;i++) if(m % i == 0) {
		r.push_back(i);
		while(m % i == 0) m /= i;
	}
	if(m) r.push_back(m);
	for(const auto &x : r) {
		if(n % x == 1) {
			a.push_back(2 % x);
		}else a.push_back(1);
	}
	
	auto exgcd = [] (auto &&self,ll a,ll b,ll &x,ll &y) {
		if(!b) {
			x = 1;y = 0;
			return a;
		}
		ll d = self(self,b,a % b,x,y);
		ll t = x;
		x = y;
		y = t - (a / b) * y;
		return d;
	};
	
	auto CRT = [&] () {
		int k = a.size();
		ll n = 1,res = 0;
		for(int i = 0;i < k;i++) {
			n = n * r[i];
//			cout << a[i] << ' ' << r[i] << '\n';
		}
		for(int i = 0;i < k;i++) {
			ll m = n / r[i],b,y;
			exgcd(exgcd,m,r[i],b,y);
			res = (res + a[i] * m * b % n) % n;
		}
		return (res % n + n) % n;
	};
	
	ans.push_back(CRT());
	ans.push_back(n - ans.back());
	cout << (int)ans.size() << '\n';
	for(auto &x : ans) cout << x << ' ';
	cout << '\n';
}


int main(){
//	freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	while(T--){
		work();
	}	
	return 0;
}