#include <bits/stdc++.h>

#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

using namespace std;

template <typename T> inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();
    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (isdigit(ch) && ch != EOF) {
        n = (n << 3) + (n << 1) + (ch & 15);
        ch = getchar();
    }
    n *= w;
}

template <typename T> inline void write(T x) {
    T l = 0;
    ull y = 0;
    if (!x) { putchar(48); return; }
    if (x < 0) { x = -x; putchar('-'); }
    while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
    while (l) { putchar(y % 10 + 48); y /= 10; --l; }
}

template <typename T> inline void writes(T x) {
    write(x);
    putchar(' ');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

template <typename T> inline void checkmax(T &a, T b) { a = a > b ? a : b; }

template <typename T> inline void checkmin(T &a, T b) { a = a < b ? a : b; }

inline bool isp(int x) {
    if (x == 1) return false;
    for (int i = 2; i * i <= x; i ++)
        if (x % i == 0) return false;
    return true;
}

inline int ksm(int x, int y, int z) {
    int k = 1;
    while (y) {
        if (y & 1) k = (LL)k * x % z;
        x = (LL)x * x % z;
        y >>= 1;
    }
    return k;
}

int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int s, x;
    read(s); read(x);
    if (__gcd(s, x) == 1) {
        cout << 1 << '\n';
        cout << s << '\n';
        return 0;
    }
    if ((s & 1) && !(x & 1)) {
        cout << 3 << '\n';
        cout << 1 << ' ';
        s --;
    }
    else {
        cout << '2' << '\n';
    }
    int ss = 1;
    for (int i = 1; i * i <= x; i ++) {
        if (x % i != 0) continue;
        if (isp(i)) {
            ss *= i;
        }
        if (i != x / i && isp(x / i)) {
            ss *= (x / i);
        }
    }
    int X = 0;
    for (int i = 1; i * i <= x; i ++) {
        if (x % i != 0) continue;
        if (isp(i)) {
            if (s % i != 1) X = (X + (LL)(ss / i) * ksm(ss / i, i - 2, i) % ss) % ss;
            else X = (X + ss - (LL)(ss / i) * ksm(ss / i, i - 2, i) % ss) % ss;
        }
        if (i != x / i && isp(x / i)) {
            if (s % (x / i) != 1) X = (X + (LL)(ss / (x / i)) * ksm(ss / (x / i), x / i - 2, x / i) % ss) % ss;
            else X = (X + ss - (LL)(ss / (x / i)) * ksm(ss / (x / i), (x / i) - 2, (x / i)) % ss) % ss;
        }
    }
    cout << X << ' ' << s - X << '\n';
    return 0;
}