#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <array>
#include <tuple>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <list>
#include <cstdio>
#include <limits.h>
#include <string.h>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define GRESORT(v) sort(v.begin(),v.end(),greater<int>())
#define REVERSE(v) reverse(v.begin(),v.end())
#define overlap(v) v.erase(unique(v.begin(),v.end()),v.end())
#define debug(x) cout << #x <<": " << x << endl
#define INF 999999999

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};

map<int,bool> mp;
int tmp;
int x,y;
vector<int> ans(4);

void solve(){
    for(int i = 0; i < 10; i++) mp[i] = false;
    for(int i = 0; i < 10; i++){
        for(int j = 0; j < 4; j++){
            if(j) cout << " ";
            cout << i;
        }
        cout << endl;
        cin >> x >> y;
        if(x) mp[i] = true;
        else tmp = i;
    }
    for(int i = 0; i < 10; i++){
        if(mp[i]){
            for(int j = 0; j < 4; j++){
                for(int k = 0; k < 4; k++){
                    if(k) cout << " ";
                    if(j == k) cout << i;
                    else cout << tmp;
                }
                cout << endl;
                cin >> x >> y;
                if(x){
                    ans[j] = i;
                    break;
                }
            }
        }
    }
    for(int i = 0; i < 4; i++){
        if(i) cout << " ";
        cout << ans[i];
    }
    cout << endl;
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    solve();

    return 0;
}