#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int main()
{
	int used[10] = {0};
	int x, y, cnt = 0;

	for (int i = 0; i <= 9; i++) {
		for (int j = i + 1; i <= 8; j++) {
			for (int k = j + 1; k <= 7; k++) {
				for (int l = k + 1; l <= 6; l++) {
					printf("%d %d %d %d\n",i,j,k,l);
					cin >> x >> y;
					if (x == 0 && y == 0) {
						if (used[i] != 1)cnt++;
						if (used[j] != 1)cnt++;
						if (used[k] != 1)cnt++;
						if (used[l] != 1)cnt++;
						used[i] = 1;
						used[j] = 1;
						used[k] = 1;
						used[l] = 1;
						if (cnt >= 6) {
							int n = 0;
							for (int a = 0; a < 10; a++) {
								if (!used[a]) {
									n++;
									cout << a;
									if (n != 4)cout << " ";
								}
							}
							cout << endl;
							cin >> x >> y;
							return 0;
						}
					}
				}
			}
		}
	}
	return 0;
}