#include<bits/stdc++.h>
using namespace std;
#define time chrono::system_clock::now().time_since_epoch().count()
mt19937_64 rnd(time);
#define maxn 1000005
#define int long long

int read() {int x;cin>>x;return x;}

void solve() {
    int n = read(), s = read();
    if(__gcd(n, s) == 1) {
        cout << 1 << "\n" << n << "\n";
        return;
    }
    // cout << __gcd(-5, 10) << "!!!\n";
    for(int i = -1e6; i <= 1e6; i++) {
        if(__gcd(abs(i), s) == 1 && __gcd(abs(n - i), s) == 1 && abs(n - i) <= 1e9) {
            cout << 2 << "\n";
            cout << i << " " << n - i << "\n";
            return;
        }
    }
    // if(n != 9 || s != 6) while(1);
    for(int i = -500; i <= 500; i++) {
        for(int j = -500; j <= 500; j++) {
            if(__gcd(abs(i), s) == 1 && __gcd(abs(j), s) == 1 && __gcd(abs(n - i - j), s) == 1 && abs(n - i - j) <= 1e9) {
                cout << 3 << "\n";
                cout << i << " " << j << " " << n - i - j << "\n";
                return;
            }
        }
    }
    // for(int i = -50; i <= 50; i++) {
    //     for(int j = -50; j <= 50; j++) {
    //         for(int k = -50; k <= 50; k++) {
    //             if(__gcd(abs(i), s) == 1 && __gcd(abs(j), s) == 1 && __gcd(abs(k), s) == 1 && __gcd(abs(n - i - j - k), s) == 1 && abs(n - i - j - k) <= 1e9) {
    //                 cout << 4 << "\n";
    //                 cout << i << " " << j << " " << k << " " << n - i - j - k << "\n";
    //                 return;
    //             }
    //         }
    //     }
    // }
}

signed main() {
    #ifdef ONLINE_JUDGE
        ios::sync_with_stdio(false);
        cin.tie(0);cout.tie(0);
    #else
        //freopen("a.in", "r", stdin);
    #endif

    solve();
    return 0;
}