#include using namespace std; struct Initializer { Initializer() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(15); } } initializer; template inline istream& operator>>(istream &s, vector &v) { for (T &t : v) s >> t; return s; } template inline ostream& operator<<(ostream &s, const vector &v) { for (const T &t : v) s << t << endl; return s; } template inline T min(vector& v) {return *min_element(v.begin(), v.end());} template inline T max(vector& v) {return *max_element(v.begin(), v.end());} template inline int min_element(vector& v) {return min_element(v.begin(), v.end()) - v.begin();} template inline int max_element(vector& v) {return max_element(v.begin(), v.end()) - v.begin();} template inline void sort(vector& v) {sort(v.begin(), v.end());} template inline void sort(vector& v, Function func) {sort(v.begin(), v.end(), func);} template inline void rsort(vector& v) {sort(v.rbegin(), v.rend());} template inline void reverse(vector& v) {reverse(v.begin(), v.end());} template inline void unique(vector& v) {v.erase(unique(v.begin(), v.end()), v.end());} template inline void nth_element(vector& v, int n) {nth_element(v.begin(), v.begin() + n, v.end());} template inline bool next_permutation(vector& v) {return next_permutation(v.begin(), v.end());} template inline int find(vector& v, T t) {return find(v.begin(), v.end(), t) - v.begin();} template inline int in(vector v, T t) {return find(v, t) != (int)v.size();} template inline int lower_bound(vector& v, T t) {return lower_bound(v.begin(), v.end(), t) - v.begin();} template inline int upper_bound(vector& v, T t) {return upper_bound(v.begin(), v.end(), t) - v.begin();} template inline T accumulate(const vector& v, function func = plus()) {return accumulate(v.begin(), v.end(), T(), func);} template inline void adjacent_difference(vector& v) {adjacent_difference(v.begin(), v.end(), v.begin());} template inline void adjacent_difference(vector& v, vector& u) {adjacent_difference(v.begin(), v.end(), u.begin());} template inline void partial_sum(vector& v, vector& u) {partial_sum(v.begin(), v.end(), u.begin());} template inline T inner_product(vector& v, vector& u) {return inner_product(v.begin(), v.end(), u.begin(), T(0));} template inline int count(const vector& v, T t) {return count(v.begin(), v.end(), t);} template inline int count_if(const vector& v, Function func) {return count_if(v.begin(), v.end(), func);} template inline void remove_if(vector& v, Function func) {v.erase(remove_if(v.begin(), v.end(), func), v.end());} template inline bool any_of(vector v, Function func) {return any_of(v.begin(), v.end(), func);} template inline vector subvector(vector& v, int a, int b) {return vector(v.begin() + a, v.begin() + b);} template inline int kinds(const vector& v) {return set(v.begin(), v.end()).size();} template inline void iota(vector& v) {iota(v.begin(), v.end(), T());} template int least_bit(T n) { static_assert(sizeof(T) == 4 || sizeof(T) == 8, "unsupported size"); if (sizeof(T) == 4) return __builtin_ffs(n) - 1; if (sizeof(T) == 8) return __builtin_ffsll(n) - 1; } template int most_bit(T n) { static_assert(sizeof(T) == 4 || sizeof(T) == 8, "unsupported size"); if (sizeof(T) == 4) return n ? 31 - __builtin_clz(n) : -1; if (sizeof(T) == 8) return n ? 63 - __builtin_clzll(n) : -1; } template int count_bit(T n) { static_assert(sizeof(T) == 4 || sizeof(T) == 8, "unsupported size"); if (sizeof(T) == 4) return __builtin_popcount(n); if (sizeof(T) == 8) return __builtin_popcountll(n); } class BitIterator : public iterator { public: class Iterator : public iterator { private: int val, bit; public: Iterator(int val, int bit) : val(val), bit(bit) {} Iterator operator*() { return *this; } bool operator!=(const Iterator& itr) const { return val != itr.val; } void operator++() { val = least_bit(bit & (-1 << (val + 1))); } operator int() { return val; } }; Iterator i, n; int bit; BitIterator(int n) : i(least_bit(n), n), n(-1, n), bit(n) {} bool operator!=(const BitIterator& itr) const { return i != itr.i; } void operator++() { *this = BitIterator(bit + 1); } operator int() const { return bit; } bool in(int i) const { return bit & (1 << i); } Iterator& begin() { return i; } Iterator& end() { return n; } }; class FixSizeSet { private: struct Iterator : public iterator { private: BitIterator val, n; public: Iterator(int val, int n) : val(val), n(n) {} Iterator operator*() { return *this; } bool operator!=(const Iterator& itr) const { return n != itr.n; } void operator++() { int x = val & -val, y = val + x; val = ((val & ~y) / x / 2) | y; if (val >= (1 << n)) n = 0; } operator int() const { return val; } bool in(int i) const { return val.in(i); } BitIterator::Iterator& begin() { return val.begin(); } BitIterator::Iterator& end() { return val.end(); } }; Iterator i, n; public: FixSizeSet(int n, int k) : i((1 << k) - 1, n), n(0, 0) {} Iterator& begin() { return i; } Iterator& end() { return n; } }; pair query(const vector& n) { cout << n[0] << " " << n[1] << " " << n[2] << " " << n[3] << endl; int x, y; cin >> x >> y; return make_pair(x, y); } int main() { map, pair> mem; for (auto i : FixSizeSet(10, 4)) { vector v; for (auto j : i) v.emplace_back(j); do { bool ok = true; for (const auto& q : mem) { int x = 0, y = 0; for (int k = 0; k < 4; ++k) { if (q.first[k] == v[k]) ++x; else if (in(v, q.first[k])) ++y; } if (x != q.second.first || y != q.second.second) ok = false; } if (!ok) continue; auto q = query(v); if (q.first == 4) return 0; mem[v] = q; } while (next_permutation(v)); } }