#include <bits/stdc++.h>
using namespace std;

const int MXP = 30;
int S, X, p(1);
int pms[MXP], pid;

void exgcd(int a, int b, int &x, int &y) {
  if (!b) x = 1, y = 0;
  else exgcd(b, a % b, y, x), y -= a / b * x;
}

int getinv(int a, int b) {
  a %= b;
  int x(0), y(0);
  exgcd(a, b, x, y);
  return (x % b + b) % b;
}

void solve2() {
  int a1(0);
  for (int i(0); i != pid; ++i) {
    if (pms[i] == 2) {
      a1 = p / 2;
      continue;
    }
    int t1(1), t2((S - 1) % pms[i]);
    if (!t2) ++t1;
    a1 = (a1 + t1 * 1LL * getinv(p / pms[i], pms[i]) % p * (p / pms[i])) % p;
  }
  cout << "2\n" << a1 << ' ' << S - a1 << endl;
}
void solve3() {
  int a1(0), a2(0);
  for (int i(0); i != pid; ++i) {
    if (pms[i] == 2) {
      a1 = a2 = p / 2;
      continue;
    }
    int t1(1), t2(1), t3((S - 2) % pms[i]);
    if (!t3) ++t2;
    int coe(getinv(p / pms[i], pms[i]) * 1LL * (p / pms[i]) % p);
    a1 = (a1 + t1 * 1LL * coe) % p;
    a2 = (a2 + t2 * 1LL * coe) % p;
  }
  cout << "3\n" << a1 << ' ' << a2 << ' ' << S - a1 - a2 << endl;
}

inline int gcd(int x, int y) {
  while (y) tie(x, y) = make_pair(y, x % y);
  return x;
}

int main() {
  cin >> S >> X;
  if (gcd(S, X) == 1) cout << "1\n" << S << endl;
  else {
    for (int i(2); i * i <= X; ++i) {
      if (X % i) continue;
      while (X % i == 0) X /= i;
      pms[pid++] = i, p *= i;
    }
    if (X != 1) pms[pid++] = X, p *= X;
    if (pid && pms[0] == 2 && S & 1) solve3();
    else solve2();
  }
  return 0;
}