#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int solve(int x){

  vector <int> cands = {0,1,2,3,4,5,6,7,8,9};
  vector <int> others1 = {7,8,9};
  vector <int> others2 = {1,2,3};
  map <int, vector <int> > in1,in2;
  rep(i,sz(cands)){
    vector <int> out(4);
    vector <int> &others = others1;
    if (cands[i] >= 7) {
      others = others2;
    }
    int cnt = 0;
    rep(j,4){
      if (j == x){
        out[j] = cands[i];
      }else{
        out[j] = others[cnt++];
      }
    }
    rep(j,4){
      if (j) cout << ' ';
      cout << out[j];
    }
    cout << endl;
    cout << std::flush;
    int a,b;
    cin >> a >> b;
    if (cands[i] >= 7) {
      in2[a].pb(i);
    }else{
      in1[a].pb(i);
    }
  }
  //DEBUG2(in1,in2);
  //assert(sz(in1) > 1 || sz(in2) > 1);
  //assert(sz(in1) <= 1 || sz(in2) <= 1);
  auto &in = in1;
  if (sz(in2) > 1) {
    in = in2;
  }
  auto it = in.rbegin();
  auto is = it->sec;
  //DEBUG1(is);
  //assert(sz(is) == 1);
  return is.front();
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int ans[4];
  rep(i,4){
    ans[i] = solve(i);
  }
  rep(i,4){
    if (i) cout << ' ';
    cout << ans[i];
  }
  cout << endl;
  return 0;
}