#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const ll INF = 2e18;
const int INFi = 1e9;
const int N = 2e5 + 5;
const int LG = 20;

void solve() {
    int s, x; cin >> s >> x;
    const int SZ = 3e3 + 5;
    vector<bool> ok(SZ);
    rep(i, SZ) ok[i] = (i == 0 || gcd(i, x) == 1);
    vector<int> dp(SZ, INFi), prv(SZ, -1);
    queue<int> q;
    dp[0] = 0;
    q.push(0);
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        rep(u, SZ) {
            if (dp[u] <= dp[v] + 1) continue;
            if (ok[abs(u - v)]) {
                dp[u] = dp[v] + 1;
                prv[u] = u - v;
                q.push(u);
            }
        }
    }
    int ans = INFi;
    int f = -1;
    const int MX = 1e9;
    for(int diff = -SZ + 1; diff < SZ; ++diff) {
        int val = s + diff;
        if (abs(val) > MX) continue;
        if (abs(gcd(val, x)) != 1) continue;
        int total = dp[abs(diff)] + 1;
        if (total < ans) {
            ans = total;
            f = val;
        }
    }
    assert(ans < INFi);
    vi res;
    res.push_back(f);
    s -= f;
    ans--;
    while (s != 0) {
        assert(abs(s) < SZ);
        assert(dp[abs(s)] == ans);
        f = prv[abs(s)];
        if (s < 0) {
            res.push_back(-f);
            s += f;
        } else {
            res.push_back(f);
            s -= f;
        }
        ans--;
    }
    cout << res.size() << '\n';
    for(auto &x : res) cout << x << ' ';
    cout << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
//    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}