#include <bits/stdc++.h>

using namespace std;
#define int long long
#define endl "\n"
#define PII pair<int, int>
#define PDD pair<double, double>
#define PDI pair<double, int>
#define xx first
#define yy second
#define PI acos(-1)
typedef long long ll;
typedef unsigned long long ull;

const int N = 1e6 + 7;
const int mod = 1e9 + 7; // 998244353

int biaoji[N], v[N] = {1, 1}, pri[N], idx;

void fast()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const int x = 1e5;
void getp() // 欧拉筛
{
    for (int i = 2; i <= x; i++)
    {
        if (v[i] == 0)
        {
            pri[++idx] = i;
        }

        for (int j = 1; j <= idx; j++)
        {
            if (i * pri[j] > x)
            {
                break;
            }

            v[i * pri[j]] = 1;

            if (i % pri[j] == 0)
                break;
        }
    }
}
signed main()
{
    fast();
    int n, s;
    cin >> n >> s;
    getp();
    if (gcd(n, s) == 1)
    {
        cout << "1" << endl;
        cout << n << endl;
        return 0;
    }

    int i, j;
    if ((n % 2 == 1) && (s % 2 == 0))
    {
        for (i = 0; i < idx; i++)
        {
            if (gcd(pri[i], s) == 1)
            {
                break;
            }
        }
        n -= pri[i];
        for (j = 0; j < idx; j++)
        {
            if (gcd(abs(n - pri[j]), s) == 1 && gcd(pri[j], s) == 1)
            {
                break;
            }
        }
        cout << 3 << endl;
        cout << pri[i] << ' ' << pri[j] << ' ' << n - pri[j] << endl;
    }
    else
    {
        for (i = 0; i < idx; i++)
        {
            if (gcd(abs(n - pri[i]), s) == 1 && gcd(pri[i], s) == 1)
            {
                break;
            }
        }
        cout << 2 << endl;
        cout << n - pri[i] << ' ' << pri[i] << endl;
    }
}