#include<iostream>
#include<climits>
#include<vector>
#include<algorithm>

void print(int a, int b, int c, int d) {
	std::cout << a << " " << b << " " << c << " " << d << std::endl;
}

int main() {
	int a = 1, b = 2, c = 3, d = 4;
	int hit, blow;

	print(a, b, c, d);
	std::cin >> hit >> blow;

	if (hit == 4) return 0;

	int h, bl, pre;
	while(d < 10) {
		print(a, b, c, d);
		std::cin >> h >> bl;
		if (h + bl > hit + blow) {
			hit = h;
			blow = b;
			break;
		}
		if (h + bl < hit + blow) {
			d = pre;
			break;
		}
		if (h == 4) return 0;
		pre = d;
		d++;
	}

	while (c < 10) {
		print(a, b, c, d);
		std::cin >> h >> bl;
		if (h + bl > hit + blow) {
			hit = h;
			blow = b;
			break;
		}
		if (h + bl < hit + blow) {
			c = pre;
			break;
		}
		if (h == 4) return 0;
		pre = c;
		c++;
	}
	while (b < 10) {
		print(a, b, c, d);
		std::cin >> h >> bl;
		if (h + bl > hit + blow) {
			hit = h;
			blow = b;
			break;
		}
		if (h + bl < hit + blow) {
			b = pre;
			break;
		}
		if (h == 4) return 0;
		pre = b;
		b++;
	}
	while (a < 10) {
		print(a, b, c, d);
		std::cin >> h >> bl;
		if (h + bl > hit + blow) {
			hit = h;
			blow = b;
			break;
		}
		if (h + bl < hit + blow) {
			a = pre;
			break;
		}
		if (h == 4) return 0;
		pre = a;
		a++;
	}

	std::vector<int> v;
	v.push_back(a);
	v.push_back(b);
	v.push_back(c);
	v.push_back(d);

	std::sort(v.begin(), v.end());

	do {
		print(v[0], v[1], v[2], v[3]);
		std::cin >> h >> bl;
		if (h == 4) return 0;
	} while (std::next_permutation(v.begin(), v.end()));

	return 0;
}