#include<bits/stdc++.h>
#define gcd __gcd
using namespace std;
using ll = long long;
using db = double;
const int N = 2e5 + 7;
int i, j, k, n, m;

mt19937 rd(time(0));

int main() {
	cin >> n >> m;
	if(gcd(n, m) == 1) return cout << "1\n" << n,0;
	if(n % 2 && !(m % 2)) {
		cout << "3\n1 ";
		n--;
		while(1) {
			k = rd() % n + 1;
			if(gcd(k, m) == 1 && gcd(n - k, m) == 1) {
				cout << k << " " << n - k;
				return 0;
			}
		}
	} else {
		cout << "2\n";
		while(1) {
			k = rd() % n + 1;
			if(gcd(k, m) == 1 && gcd(n - k, m) == 1) {
				cout << k << " " << n - k;
				return 0;
			}
		}
	}
	return 0;
}