#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e18;
const ld eps = 1e-6;

ll add (ll a, ll b) {
	a += b;
	if (a < 0) a += mod;
	if (a >= mod) a -= mod;
	return a;
}

ll mul (ll a, ll b) {
	a *= b;
	if (a >= mod) a %= mod;
	return a;
}

void solve () {
	int s, x;
	cin >> s >> x;
	if (__gcd(s, x) == 1) cout << "1\n" << s << '\n', exit(0);
	vt<int> ans;
	if (x % 2 == 0 && (s & 1)) {
		ans.pb(1);
		s--;
	}
	for (int i = 1; ; i += 1 + (x % 2 == 0)) {
		if (__gcd(i, x) == 1 && __gcd(s - i, x) == 1) {
		    ans.pb(i); ans.pb(s - i);
			break;
		}
	}
	cout << sz(ans) << '\n';
	for (int i: ans) cout << i << ' ';
	cout << '\n';
}

bool testcases = 0;

signed main() {
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}