#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int f[10] = {};
    int a[10] = {};
    int ma = -1;
    int x, y;
    srep(i,3,10){
        cout << "0 1 2 " << i << endl;
        fflush(stdout);
        cin >> x >> y;
        if(x == 4)return 0;
        ma = max(ma, x + y);
        a[i] = x + y;
    }
    srep(i,3,10)if(a[i] == ma)f[i] = 1;

    ma = -1;
    rep(i,7){
        cout << "7 8 9 " << i << endl;
        fflush(stdout);
        cin >> x >> y;
        if(x == 4)return 0;
        ma = max(ma, x + y);
        a[i] = x + y;
    }
    rep(i,7)if(a[i] == ma)f[i] = 1;

    int cnt = 0;
    int b[4];
    rep(i,10){
        if(f[i]){
            b[cnt] = i;
            cnt++;
        }
    }

    do{
        rep(i,4)cout << b[i] << ' ';
        cout << endl;
        fflush(stdout);
        cin >> x >> y;
        if(x == 4)return 0;
    }while(next_permutation(b,b+4));

    return 0;
}