#include <cstdio>
#include <iostream>

using namespace std;

typedef long long ll;
ll m[15], c[15];

ll x, y;

ll exgcd(ll a, ll b)
{
	if (!b)
	{
		x = 1, y = 0;
		return a;
	}
	ll d = exgcd(b, a % b);
	ll tmp = x;
	x = y;
	y = tmp - (a / b) * y;
	return d;
}

int main()
{
	int n = 0;
	int s, t;
	cin >> s >> t;
	
	bool Fl = 0;
	if ((s & 1) && !(t & 1)) Fl = 1, s--;
	
	for (int i = 2; i * i <= t; i++)
		if (t % i == 0)
		{
			m[++n] = i;
			if (s % i == 0) c[n] = 1;
			else if (s % i == 1) c[n] = i - 1;
			else c[n] = 1;
			while (t % i == 0) t /= i;
		}
	if (t > 1)
	{
		m[++n] = t;
		if (s % t == 0) c[n] = 1;
		else if (s % t == 1) c[n] = t - 1;
		else c[n] = 1;
	}
	
	ll M = 1, ans = 0;
	for (int i = 1; i <= n; i++) M *= m[i];
	for (int i = 1; i <= n; i++)
	{
		ll a = M / m[i], b = m[i];
		ll gcd = exgcd(a, b);
		if (x < 0) x += b;
		ans += a * x * c[i];
	}
	ans %= M;
	
	if (!Fl) cout << "2\n" << ans << " " << s - ans;
	else cout << "3\n1 " << ans << " " << s - ans;
	return 0;
}