#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}

pair<long long, long long> gcd_extended(long long a, long long b) {
  if (b == 0)
    return make_pair(1, 0);
  long long q = a / b, r = a % b;
  auto tmp = gcd_extended(b, r);
  return make_pair(tmp.second, tmp.first - q * tmp.second);
}

long long solve_kto(vector<pair<long long, long long>> vals) {
  long long m1 = vals[0].first;
  long long r1 = vals[0].second;
  for (int i = 1; i < vals.size(); ++i) {
    long long m2 = vals[i].first;
    long long r2 = vals[i].second;
    auto [a, b] = gcd_extended(m1, m2);
    long long x = (a % m2) * ((r2 - r1) % m2) % m2;
    if (x < 0)
      x += m2;
    r1 += x * m1;
    m1 *= m2;
  }
  return r1;
}

const long long INF = 1'000'000'000;

vector<long long> solve(long long s, long long x) {
  if (gcd(s, x) == 1)
    return {s};
  vector<pair<long long, int>> primes;
  long long y = x;
  long long i = 2;
  while (i * i <= y) {
    if (y % i == 0) {
      int cnt = 0;
      while (y % i == 0) {
        ++cnt;
        y /= i;
      }
      primes.emplace_back(i, cnt);
    }
    ++i;
  }
  if (y > 1)
    primes.emplace_back(y, 1);
  while (true) {
    vector<pair<long long, long long>> vals;
    for (int i = 0; i < primes.size(); ++i) {
      long long q = 1;
      long long p = primes[i].first;
      for (int j = 0; j < primes[i].second; ++j)
        q *= p;
      long long r = s % p;
      if (p == 2) {
        r = 1;
      } else {
        while (s % p == r) {
          r = 1 + rand() % (p - 1);
        }
      }
      vals.emplace_back(q, r);
    }
    if (x % 2 == 0 && s % 2 == 1) {
      vals[0] = make_pair(4, 2);
      long long t = solve_kto(vals);
      if (abs(s - t) <= INF)
        return {s - t, t / 2, t / 2};
    } else {
      long long t = solve_kto(vals);
      return {s - t, t};
    }
  }
}

//#define DEBUG

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

#ifdef DEBUG
  for (long long s = 2; s <= INF; ++s) {
    for (long long x = 2; x <= INF; ++x) {
      auto ans = solve(s, x);
      bool ok = true;
      long long real = 0;
      for (long long y : ans) {
        ok = ok && abs(gcd(y, x)) == 1 && abs(y) <= INF;
        real += y;
      }
      ok = ok && real == s;
      if (!ok) {
        cerr << "BUG!!\n";
        cerr << s << ' ' << x << '\n';
        for (long long y : ans)
          cerr << y << ' ';
        cerr << '\n';
      }
    }
  }
#else
  long long s, x;
  cin >> s >> x;
  auto ans = solve(s, x);
  cout << ans.size() << '\n';
  long long kek = 0;
  for (long long y : ans) {
    cout << y << ' ';
    kek += y;
  }
  cout << '\n';
#endif
  return 0;
}