#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdlib>
using namespace std;
int X,Y;
void f(int a,int b,int c,int d)
{
	cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
	cin>>X>>Y;
	if(X==4&&Y==0)exit(0);
}
main()
{
	f(0,1,2,3);
	int L=X+Y;
	f(4,5,6,7);
	int R=X+Y;
	vector<int>A;
	for(int i=0;A.empty()&&i<1<<4;i++)
	{
		if(__builtin_popcount(i)!=L)continue;
		for(int j=0;A.empty()&&j<1<<4;j++)
		{
			if(__builtin_popcount(j)!=R)continue;
			vector<int>B;
			for(int k=0;k<4;k++)
			{
				if(i>>k&1)B.push_back(k);
				if(j>>k&1)B.push_back(k+4);
			}
			if(L+R==4)
			{
				f(B[0],B[1],B[2],B[3]);
				if(X+Y==4)
				{
					A=B;
				}
			}
			else if(L+R==2)
			{
				B.push_back(8);
				B.push_back(9);
				f(B[0],B[1],B[2],B[3]);
				if(X+Y==4)
				{
					A=B;
				}
			}
			else
			{
				B.push_back(8);
				f(B[0],B[1],B[2],B[3]);
				if(X+Y==4)
				{
					A=B;
				}
				else
				{
					B.back()=9;
					f(B[0],B[1],B[2],B[3]);
					if(X+Y==4)
					{
						A=B;
					}
				}
			}
		}
	}
	sort(A.begin(),A.end());
	do{
		f(A[0],A[1],A[2],A[3]);
	}while(next_permutation(A.begin(),A.end()));
}