#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using namespace std;

int x,y,a[4]={0,1,2,3};

inline bool query(){
	rep(i,4) cout << (i?" ":"") << a[i];
	cout << flush;
	cin >> x >> y;
	return (x==4);
}

int main(void){
	if(query()) return 0;

	rep(i,4,10){
		rep(j,4){
			int px=x,py=y,tmp=i;
			swap(a[j],tmp);
			if(query()) return 0;
			if(x+y>px+py) break;
			swap(a[j],tmp);
			x=px,y=py;
		}
	}

	sort(a,a+4);
	do{
		if(query()) return 0;
	}while(next_permutation(a,a+4));
	return 0;
}