#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;

int gcd(int x, int y) {
    x = abs(x), y = abs(y);
    if (x < y) swap(x, y);
    if (y == 0) return x;
    return gcd(y, x % y);
}

int sum, n;
vector<int> ans;
int main() {
    scanf("%d%d", &sum, &n);

    if (gcd(sum, n) == 1) {
        printf("1\n%d\n", sum);
        return 0;
    }

    if (n % 2 == 0 && sum % 2 == 1) {
        for (int i = 1;;i++) {
            if (gcd(i, n) == 1) {
                ans.push_back(i);
                sum -= i;
                break;
            }
        }
    }

    for (int i = 1;;i++) {
        if (gcd(i, n) == 1 && gcd(sum - i, n) == 1) {
            ans.push_back(i);
            ans.push_back(sum - i);
            break;
        }
    }

    printf("%d\n", ans.size());
    for (auto& p : ans) {
        printf("%d ", p);
    }
    printf("\n");
}