#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
	int n[4], x, y, i, j, k, l, kakcnt = 0, kakutei[4];
	for (i = 0; i < 10; i++) {
		n[0] = i;
		j = 0; k = 1; l = 0;
		while (j < 9) {
			while (k <= 3) {
				if (j != i) {
					n[k] = j;
					j++; k++;
				}
				else j++;
			}
			cout << n[0] << " " << n[1] << " " << n[2] << " " << n[3] << flush;
			cin >> x >> y;
			if (x == 4)return 0;
			l += x + y;
			k = 1;
		}
		if (l == 6) {
			kakutei[kakcnt] = i;
			kakcnt++;
			if (kakcnt >= 4)break;
		}
	}
	cout << kakutei[0] << " " << kakutei[1] << " " << kakutei[2] << " " << kakutei[3] << flush;
	cin >> x >> y;
	if (x == 4)return 0;
	while (next_permutation(kakutei, kakutei + 4)) {
		cout << kakutei[0] << " " << kakutei[1] << " " << kakutei[2] << " " << kakutei[3] << flush;
		cin >> x >> y;
		if (x == 4)return 0;
	}
	return 0;
}