#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int N = 1e6 + 5;
int n, m;
int top, sta[N];
void dfs(int d, int de){
	if (de == d){
		cout << de << endl;
		for (int i = 0; i < top; i++){
			cout << sta[i] << ' ';
			assert(abs(sta[i]) <= 1e9);
		}
		exit(0);
		return;
	}
	if (de + 1 == d){
		int sum = 0;
		for (int i = 0; i < top; i++) sum += sta[i];
		sta[top] = n - sum;
		top++;
		if (__gcd(abs(sta[top - 1]), m) == 1) dfs(d, de + 1);
		top--;
	}else
		for (int i = 0; i < m; i++)
			if (__gcd(i, m) == 1){
				sta[top] = i;
				top++;
				dfs(d, de + 1);
				top--;
			}
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//	freopen("in.txt", "r", stdin);
//	freopen("out.txt", "w", stdout);
	cin >> n >> m;
	if (__gcd(n, m) == 1){
		cout << 1 << endl;
		cout << n << ' ';
		return 0;
	}
	int x = 2;
	if (n % 2 == 1 && m % 2 == 0) x++;
	while (1) dfs(x, 0), x++; 
	return 0;
}