#include <bits/stdc++.h>
#define ll long long
#define db double
#define fi first
#define se second
#define pb push_back
using namespace std;

ll read() {
    ll x = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') {x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar();}
    return x * f;
}

const int mod = 998244353;

#define mid ((l + r) >> 1)

ll ksm(ll x, ll y) {
    ll base = 1;
    for(; y; y >>= 1) {
        if(y & 1) base = base * x % mod;
        x = x * x % mod;
    }
    return base;
}
 
ll q[100], ct;
ll n, m, a, b, sum;
 
int main() {
    n = read(); m = read(); sum = 1;
    if(__gcd(n, m) == 1) return printf("1\n%lld", n), 0;
    if((n & 1) && !(m & 1)) printf("3\n1 "), n--;
    else printf("2\n");
    a = n + 1; b = 1;
    for(int i = 2; i * i <= m; i++) {
        if(!(m % i)) q[++ct] = i;
        while(!(m % i)) m /= i;
    }
    if(m != 1) q[++ct] = m;
    sort(q + 1, q + 1 + ct);
    for(int i = 1; i <= ct; i++) {
        while(!(a % q[i]) || !(b % q[i])) a -= sum, b -= sum;
        sum = sum * q[i];
    }
    printf("%lld %lld", a, -b);
    return 0;
}
/*
10000
9
JAAAJAJAA
AJAJJAJAA
*/