#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
vector<int> ans;
int main() {
	int x, y;
	int num[10];
	for (int i = 0; i < 9; i++) {
		num[i] = i + 1;
	}
	for (int i = 0; i <= 9; i++) {
		int co = 0;
		for (int j = 0; j < 9; j += 3) {
			cout << num[j] << " " << num[j + 1] << " " << num[j + 2] << " " << i << endl;
			cin >> x >> y;
			if (x == 4) {
				return 0;
			}
			co += x;
			co += y;
		}
		if (co == 6) {
			ans.emplace_back(i);
		}
		num[i]--;
	}
	cout << ans[0] << " " << ans[1] << " " << ans[2] << " " << ans[3] << endl;
	cin >> x >> y;
	if (x == 4) {
		return 0;
	}
	while (next_permutation(ans.begin(), ans.end())) {
		cout << ans[0] << " " << ans[1] << " " << ans[2] << " " << ans[3] << endl;
		cin >> x >> y;
		if (x == 4) {
			return 0;
		}
	}
}