#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using ll = long long;

//a*x+b*y=gcd(a,b)となるx,yにする　返り値gcd(a,b)
ll Euclid(ll a,ll b,ll &x,ll &y){
    if(b==0){
        x=1,y=0;
        return a;
    }
    ll d=Euclid(b,a%b,y,x);
    y-=a/b*x;
    return d;
}

// val1=(a,p) val2=(b,q)
// return (c,r)
// c: c%p==a && c%q==b
// r: r=lcm(p,q)
// need: a%gcd(p,q)==b%gcd(p,q)
// use: Euclid
std::pair<long long,long long> ctr_sub(std::pair<long long,long long> val1,std::pair<long long,long long> val2){
    long long a,b,p,q;
    long long X,Y,G,ans_val,ans_mod;
    tie(a,p)=val1;
    tie(b,q)=val2;
    if(p<q) swap(a,b),swap(p,q);
    G=Euclid(p,q,X,Y);
    if((b-a)%G!=0) return {-1,-1};
    ans_mod=p*(q/G);
    ans_val=(p*((X*((b-a)/G))%q))%ans_mod+a;
    return {(ans_val%ans_mod+ans_mod)%ans_mod,ans_mod};
}

void solve(){
    ll s, x;
    cin >> s >> x;
    ll X = x;
    vector<ll> p;
    ll tmp = 2;
    while (x >= tmp * tmp){
        if (x % tmp == 0){
            p.push_back(tmp);
            while (x % tmp == 0) x /= tmp;
        }
        tmp++;
    }
    if (x != 1) p.push_back(x);
    if (gcd(s, X) == 1){
        cout << "1\n" << s << "\n";
        return;
    }
    ll N = 2;
    if (s % 2 == 1 && X % 2 == 0) N = 3;
    vector q(p.size(), vector<pair<ll, ll>>(N));
    rep(i, 0, p.size()){
        rep(j, 0, N - 1) q[i][j].first = 1;
        q[i][N - 1].first = (s % p[i] + p[i] - N + 1) % p[i];
        if (q[i][N - 1].first == 0){
            q[i][N - 1].first = p[i] - 1;
            q[i][0].first = 2 % p[i];
        }
        rep(j, 0, N) q[i][j].second = p[i];
    }
    cout << N << "\n";
    ll sum = 0;
    rep(i, 0, N - 1){
        rep(j, 1, p.size()){
            q[0][i] = ctr_sub(q[0][i], q[j][i]);
        }
        cout << q[0][i].first << " ";
        sum += q[0][i].first;
    }
    cout << s - sum << "\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();
}