#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
std::vector<int> solve(int p, int q) {
	rep2(i, 3, 10) {
		rep(j, 1 << i) {
			vector<int>v;
			rep(k, i) v.push_back(1 & (j >> k));
			v[0] = p;
			v[1] = q;
			int cnt = 0;
			rep(k, 1 << 4) {
				vector<int>p2(4);
				rep(l, 4)p2[l] = 1 & (k >> l);
				int now = p2[v[0] * 2 + v[1]];
				rep2(l, 2, i) {
					now = p2[now * 2 + v[l]];
				}
				if (now == p2[p * 2 + q])cnt++;
			}
			if (0 == cnt || cnt == (1 << 4)) {
				rep(i, v.size())cout << v[i];
				cout << endl;
				cout << cnt << endl;
				return v;
			}
		}
	}
	cout << "><" << endl;
	return {};
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int p, q; cin >> p >> q;
	vector<int>v;
	if (0 == p * 2 + q)v = { 0,0,0,0 };
	else if(1 == p * 2 + q)v = { 0,1,1,1 };
	else if (2 == p * 2 + q)v = { 1,0,0,0 };
	else v = { 1,1,1,1 };
	cout << v.size() << endl;
	rep(i, v.size())cout << v[i] << " ";
	cout << endl;
	int get; cin >> get;
	cout << get << endl;
	return 0;
}