#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  vector<ll> v(10,-1);
  for(int i=1;i<10;i++){
    vl tp;repl(j,1,10)if(i!=j)tp.push_back(j);
    ll tmp=0;
    rep(k,2){
      rep(j,4)cout << tp[j+4*k] <<" ";cout << endl;
      ll x,y;cin >> x >> y;
      if(x==4)return 0;
      tmp+=x+y;
    }
    v[i]=4-tmp;
  }
  v[0]=1;
  rep(i,10)if(v[i]==0)v[0]=0;
  repl(i,1,10)v[i]-=v[0];
  vl p;
  rep(i,10)if(v[i])p.push_back(i);
  do{
    rep(i,4)cout  << p[i] <<" ";cout << endl;
    ll x,y;cin >> x >> y;
    if(x==4)return 0;
  }while(next_permutation(all(v)));
}