#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x =(x%p+p)%p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

using T=tuple<int,int,int,int>;

void query(T a,int &x,int &y){
  auto [p,q,r,s]=a;
  cout<<p<<" "<<q<<" "<<r<<" "<<s<<endl;
  cin>>x>>y;
  if(x==4)exit(0);
}



void solve()
{	
  vector<T>v;
  set<int>used;
  rep(a,7)REP(b,a+1,8)REP(c,b+1,9)REP(d,c+1,10)v.eb(a,b,c,d);
  int num;
  while(true){
    int n=v.size();
    int x,y;
    num=0;
    while(used.count(num))num=random()%n;
    
    query(v[num],x,y);
    if(x+y>=3){
      break;
    }
    used.emplace(num);
  }
  {
  auto [p,q,r,s]=v[num];
  int maxv=0;
  int change=p;
  rep(i,10){
    if(q!=i&&r!=i&&s!=i){
      p=i;
      int x,y;
      T t=make_tuple(p,q,r,s);
      query(t,x,y);
      if(!maxv)maxv=x+y,change=i;
      else if(chmax(maxv,x+y))change=i;
    }
  }
  get<0>(v[num])=change;
  p=change;
  maxv=0,change=q;
  rep(i,10){
    if(p!=i&&r!=i&&s!=i){
      q=i;
      int x,y;
      T t=make_tuple(p,q,r,s);
      query(t,x,y);
      if(!maxv)maxv=x+y,change=i;
      else if(chmax(maxv,x+y))change=i;
    }
  }
  get<1>(v[num])=change;
  q=change;
  maxv=0,change=r;
  rep(i,10){
    if(p!=i&&q!=i&&s!=i){
      r=i;
      int x,y;
      T t=make_tuple(p,q,r,s);
      query(t,x,y);
      if(!maxv)maxv=x+y,change=i;
      else if(chmax(maxv,x+y))change=i;
    }
  }
  get<2>(v[num])=change;
  r=change;
  maxv=0,change=s;
  rep(i,10){
    if(p!=i&&q!=i&&r!=i){
      s=i;
      int x,y;
      T t=make_tuple(p,q,r,s);
      query(t,x,y);
      if(!maxv)maxv=x+y,change=i;
      else if(chmax(maxv,x+y))change=i;
    }
  }
  get<3>(v[num])=change;
  s=change;
  }
  vector<int>ope(4);
  auto [p,q,r,s]=v[num];
  ope[0]=p,ope[1]=q,ope[2]=r,ope[3]=s;
  sort(all(ope));
  do{
    T t=make_tuple(ope[0],ope[1],ope[2],ope[3]);
    int x,y;
    query(t,x,y);
  }while(next_permutation(all(ope)));
}

int main()
{
	// ios::sync_with_stdio(false);
	// cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}