#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


#include <chrono>
#ifdef LOCAL
mt19937_64 rng(58);
#else
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#endif


int main() {
  Int S, X;
  for (; ~scanf("%lld%lld", &S, &X); ) {
    vector<Int> ans;
    if (__gcd(S, X) == 1) {
      ans = {S};
    } else if (!(S % 2 != 0 && X % 2 == 0)) {
      for (; ; ) {
        // Pr >= (1/2) \prod_p (1 - 2/p)
        const Int a = rng() % 1'000'000'000;
        if (__gcd(a, X) == 1 && __gcd(S - a, X) == 1) {
          ans = {a, S - a};
          break;
        }
      }
    } else {
      for (; ; ) {
        // Pr >= (1/2) \prod_p (1 - 2/p)
        const Int a = rng() % 1'000'000'000;
        if (__gcd(a, X) == 1 && __gcd(S - 1 - a, X) == 1) {
          ans = {1, a, S - 1 - a};
          break;
        }
      }
    }
    
    printf("%d\n", (int)ans.size());
    for (int i = 0; i < (int)ans.size(); ++i) {
      if (i) printf(" ");
      printf("%lld", ans[i]);
    }
    puts("");
  }
  return 0;
}