#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long 
#define N 200005
#define pii pair<int, int>
#define F first 
#define S second
int gcd(int a, int b){
    return (b == 0 ? a : gcd(b, a % b));
}
int s, x;
void solve(){
    cin >> s >> x;
    if(gcd(s, x) == 1){
        cout << "1\n";
        cout << s << "\n";
        return;
    }
    for (int i = 1; i <= 1000000; i++){
        // if(i >= 3)
        //     cout << s << " " << x << "\n";
        if(gcd(s - i, x) == 1){
            cout << i + 1 << "\n";
            for (int t = 1; t <= i; t++)
                cout << "1 ";
            cout << s - i << "\n";
            return;
        }
        if(gcd(s + i, x) == 1){
            cout << i + 1 << "\n";
            for (int t = 1; t <= i; t++)
                cout << "-1 ";
            cout << s + i << "\n";
            return;
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}
// signed main(){
//     ios_base::sync_with_stdio(0), cin.tie(0);
//     for (s = 2; s <= 100; s++){
//         for (x = 2; x <= 100; x++){
//             // cout << s << " " << x << "\n";
//             solve();
//         }
//     }
//     return 0;
// }