// https://qoj.ac/contest/1762/problem/9167
#include <bits/stdc++.h>
#define qqbb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define all(x) (x).begin(), (x).end()
#define int long long
#define endl '\n'
#define lb(x) x & -x
#define AA cerr<<"AA"<<endl;
using namespace std;
typedef pair<int, int> pii;
const int inf = 0x3f3f3f3f;

const int N = 2e5 + 10, M = 4e5 + 10;

void solve(){
    int n,m;cin>>n>>m;
    if(__gcd(n,m) == 1){
        cout<<1<<endl<<n;
        return;
    }
    vector<array<int,3>> ans;
    for(int i = -1000;i <= 1000; i++){
        for(int j = 1;j <= 1000; j++){
            int k = n - i - j;
            if(abs(k) >= 1e9) continue;
            int f1 = 0,f2 = 0,f3 = 0;
            if(i == 0 || __gcd(i,m) == 1){
                f1 = 1;
            }
            if(j == 0 || __gcd(j,m) == 1){
                f2 = 1;
            }
            if(k == 0 || __gcd(k,m) == 1){
                f3 = 1;
            }
            if(f1 && f2 && f3){
                ans.push_back({i,j,k});
            }
        }
    }
    for(auto [x,y,z] : ans){
        if(x == 0 || y == 0 || z == 0){
            cout<<2<<endl;
            if(x == 0) cout<<y<<' '<<z;
            else if(y == 0) cout<<x<<' '<<z;
            else cout<<x<<' '<<y;
            return;
        }
    }
    cout<<3<<endl;
    cout<<ans[0][0]<<' '<<ans[0][1]<<' '<<ans[0][2];
}

signed main(){
    qqbb;
//	cout<<fixed<<setprecision(0);
    int Test=1;
//	cin>>Test;
    while(Test--){
        solve();
    }
    return 0;
}