#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define sz(a) ((int) (a).size())
#define pb emplace_back
#define me(a, x) memset(a, x, sizeof(a))
#define vi vector<int>
using namespace std;
const int N = 1 << 16, M = 16, mod = 998244353;
ll s, x;
void Main() {
	cin >> s >> x;
	if(__gcd(s, x) == 1) {
		cout << "1\n" << s << '\n';
		return;
	}
	if(x % 2 == 1 || s % 2 == 0) {
		for(ll v = 1; v < s; ++v) {
			if(__gcd(v, x) == 1 && __gcd(s - v, x) == 1) {
				cout << 2 << '\n' << v << ' ' << s - v << '\n';
				return;
			}
		}
		for(ll v = 1; v; ++v) {
			if(__gcd(v, x) == 1 && __gcd(v + s, x) == 1) {
				cout << 2 << '\n' << -v << ' ' << v + s << '\n';
				return;
			}
		}
		return;
	}
	for(ll u = 1; u; ++u) if(__gcd(u, x) == 1) {
		for(ll v = u; u + v < s; ++v) if(__gcd(v, x) == 1) {
			if(__gcd(s - u - v, x) == 1) {
				cout << 3 << '\n' << u << ' ' << v << ' ' << s - u - v << '\n';
				return;
			}
		}
	}

	for(ll u = 1; u; ++u) if(__gcd(u, x) == 1) {
		for(ll v = 1; v <= u; ++v) if(__gcd(v, x) == 1) {
			if(__gcd(u + v + s, x) == 1) {
				cout << 3 << '\n' << u + v + s << ' ' << -u << ' ' << -v << '\n';
				return;
			}
		}
	}
}
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	// int t; cin >> t; while(t--) 
	Main();
	return 0;
}