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

#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long int;

int main() {
  int x, y;
  cin >> x >> y;
  int n = 3;
  vector<int> v(n);
  rep(i, n)
    v[i] = i % 2;
  cout << n << endl;
  rep(i, n)
    cout << v[i] << " ";
  cout << endl;
  int t;
  cin >> t;
  vector<int> p(4);
  rep(i, (1<<4)) {
    rep(j, 4) {
      p[j] = (i >> j) & 1;
    }
    int s = v[0];
    s = p[s * 2 + v[1]];
    s = p[s * 2 + v[2]];
    if (s == t) {
      cout << p[x * 2 + y] << endl;
      return 0;
    }
  }
  return 0;
}