#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    const int ma = 1e6;
    int s, x;
    cin >> s >> x;
    if (__gcd(s, x) == 1)
    {
        cout << "1\n";
        cout << s << endl;
    }
    else
    {
        vector<int> isp(ma + 1, 1);
        int tmpx = x;
        isp[0] = isp[1] = 0;
        for (int i = 2; i * i <= x; ++i)
        {
            if (x % i) continue;
            while (x % i == 0) x /= i;
            for (int j = 1; i * j <= ma; ++j) isp[i * j] = 0;
        }
        if (x != 1) for (int i = 1; i * x <= ma; ++i) isp[i * x] = 0;
        vector<int> ans;
        if (s % 2)
        {
            ans.push_back(1);
            --s;
        }
        isp[1] = 1;
        for (int i = 1; i < min(ma, s); ++i)
        {
            int g1 = __gcd(i, s), g2 = __gcd(s - i, s);
            if (g1 == 1 && g2 == 1)
            {
                if (isp[i] && isp[s - i])
                {
                    ans.push_back(i);
                    ans.push_back(s - i);
                    break;
                }
                if (s + i <= ma && isp[i] && isp[s + i])
                {
                    ans.push_back(-i);
                    ans.push_back(s + i);
                    break;
                }
            }
        }
        cout << ans.size() << endl;
        for (auto v : ans) cout << v << ' ';
        cout << endl;
    }
}