// https://www.youtube.com/watch?v=wthasN45KuY
// You said I’d fly away
// But my walls have kept me down
// Now I’m lost and I’m afraid
// And I’m close to hit the ground
// 
// You said I’d fly away
// You said I’d fly anywhere
// But I keep on Falling

#ifndef ONLINE_JUDGE
#include "templates/debug.hpp"
#else
#define debug(...)
#endif

#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;

#define int i64
void solve() {
    int s, x; cin >> s >> x;
    if (gcd(s, x) == 1) {
        cout << 1 << "\n";
        cout << s << "\n";  
    }
    // Goldbach's conjecture
    if (x <= 20000 || s <= 20000) {
        int m = min(x, s);
        vector<int> dp(m + 1, 1e9 + 7), fa(m + 1, -1);
        dp[0] = 0;
        vector<int> cop_nums;
        dp[1] = 1; cop_nums.push_back(1); fa[1] = 1;
        for (int i = 2; i <= m; i++) {
            if (gcd(i, x) == 1) {
                dp[i] = 1;
                cop_nums.push_back(i);
                fa[i] = i;
                continue;
            }
            for (int cop: cop_nums) {
                if (dp[i - cop] + 1 < dp[i]) {
                    dp[i] = dp[i - cop] + 1;
                    fa[i] = cop;
                }
            }
        }
        debug(dp);
        cout << dp[s % x] << "\n";
        vector<int> ans;
        while (s % x != 0) {
            ans.push_back(fa[s % x]);
            s -= fa[s % x];
        }
        ans[0] += s;
        for (int x: ans) cout << x << " ";
        cout << "\n";
    } else {
        auto time = chrono::high_resolution_clock::now();
        mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
        using chrono_literals::operator""ms;
        while (chrono::high_resolution_clock::now() - time < 800ms) {
            int t = rng() % int(1e9 - 7) + 1;
            if (gcd(t, x) == 1 && gcd(s - t, x) == 1) {
                cout << 2 << "\n";
                cout << t << " " << s - t << "\n";
                return;
            }
        }
        while (true) {
            int t1 = 1, t2 = rng() % (x - 1) + 1;
            if (gcd(t2, x) == 1 && gcd(s - t1 - t2, x) == 1) {
                cout << 3 << "\n";
                cout << 1 << " " << t2 << " " << s - t1 - t2 << "\n";
                return;
            }
        }
    }

}
#undef int

// Make bold hypotheses and verify carefully
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}