#include using namespace std; void output(vector &v) { for (int i = 0; i < v.size(); i++) printf("%s%d", i ? " " : "", v[i]); printf("\n"); } pair query(vector a) { for (int i = 0; i < 4; i++) cout << (i ? " " : "") << a[i]; cout << endl; int x, y; cin >> x >> y; return make_pair(x, y); } int main() { int d1 = query({0, 1, 2, 3}).second; int d2 = query({6, 7, 8, 9}).second; vector e1, e2; e1.push_back(0); for (int i = 4; i <= 9; i++) { e1.push_back(query({ 0, 1, 2, i }).second - d1); } e2.push_back(0); for (int i = 0; i <= 5; i++) { e2.push_back(query({ i, 7, 8, 9 }).second - d2); } int mx1 = *max_element(e1.begin(), e1.end()); int mx2 = *max_element(e2.begin(), e2.end()); vector cand; for (int i = 4; i <= 9; i++) { if (e1[i] == mx1) cand.push_back(i); } for (int i = 0; i <= 5; i++) { if (e2[i] == mx2) cand.push_back(i); } sort(cand.begin(), cand.end()); cand.erase(unique(cand.begin(), cand.end()), cand.end()); do { if (query(cand).first == 4) { output(cand); return 0; } } while (next_permutation(cand.begin(), cand.end())); }