#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

void solve() {
	int i,j,k,l,r,x,y; string s;
	int X,Y;
	cin>>X>>Y;
	int mask;
	FOR(mask,64) {
		int pat;
		int ok=1;
		FOR(pat,16) {
			y=x=(pat>>(X+Y*2))%2;
			FOR(j,6) {
				x=(pat>>(x+((mask>>j)&1)*2))%2;
			}
			if(x!=y) ok=0;
		}
		if(ok) {
			cout<<8<<endl;
			cout<<X<<" "<<Y<<" ";
			FOR(i,6) cout<<((mask>>(i))%2)<<" ";
			cout<<endl;
			cin>>x;
			cout<<x<<endl;
			return;
			
		}
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}