#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int main() {

  std::random_device rd;
  std::mt19937 g(rd());
  vector<int> ten(10); iota(all(ten), 0);
  vector<int> nones;

#if 1
  #define ASK(A, B, C, D) cout << A << " " << B << " " << C << " " << D << endl; cout << flush;
  #define QUERY() int hit, blow; cin >> hit >> blow;
#else

  vector<int> ans; std::shuffle(ten.begin(), ten.end(), g); rep(i, 4) ans.push_back(ten[i]);
  rep(i, 4) cout << ans[i] << " ";
  cout << endl << endl;
  vector<int> q(4);
  #define ASK(A, B, C, D) q[0] = A, q[1] = B, q[2] = C, q[3] = D; printf("%d %d %d %d\n", A, B, C, D);
  #define QUERY() int hit = 0; rep(i, 4) hit += q[i] == ans[i]; int blow = 0; rep(i, 4) rep(j, 4) if(i != j && q[i] == ans[j]) blow ++; printf("%d %d\n", hit, blow);

#endif

  auto invalid = [&](int x, int skipid) {
    rep(i, 4) {
      if(skipid != i && x == nones[i]) {
        return true;
      }
    }
    return false;
  };

  while(1) {
    std::shuffle(ten.begin(), ten.end(), g);
    ASK(ten[0], ten[1], ten[2], ten[3])
    QUERY()
    if(hit == 4) {
      exit(0);
    }
    if(hit == 0 && blow == 0) {
      rep(i, 4) nones.push_back(ten[i]);
      break;
    }
  }

  int a = -1;
  rep(i, 10) {
    if(invalid(i, 0)) { continue; }
    ASK(i, nones[1], nones[2], nones[3])
    QUERY()
    assert(hit != 4);
    if(hit > 0) {
      a = i;
    }
  }
  int b = -1;
  rep(i, 10) {
    if(invalid(i, 1)) { continue; }
    ASK(nones[0], i, nones[2], nones[3])
    QUERY()
    assert(hit != 4);
    if(hit > 0) {
      b = i;
    }
  }
  int c = -1;
  rep(i, 10) {
    if(invalid(i, 2)) { continue; }
    ASK(nones[0], nones[1], i, nones[3])
    QUERY()
    assert(hit != 4);
    if(hit > 0) {
      c = i;
    }
  }
  int d = -1;
  rep(i, 10) {
    if(invalid(i, 3)) { continue; }
    ASK(nones[0], nones[1], nones[2], i)
    QUERY()
    assert(hit != 4);
    if(hit > 0) {
      d = i;
    }
  }

  ASK(a, b, c, d)
  QUERY()
  assert(hit == 4);

  return 0;   
}