#include #define rep(i, n) for (int i = 0; i < (n); ++i) using namespace std; int get(int l1, int r1, int l2, int r2) { cout << "? " << l1 << ' ' << r1 << ' ' << l2 << ' ' << r2 << '\n'; int res; cin >> res; return res; } int main() { int n, q; cin >> n >> q; vector small, large; for (int i = 1; i <= n; i += 2) { int x = get(i, n, i+1, n); if (x == 1) { small.push_back(i); large.push_back(i+1); } else if (x == 0) { small.push_back(i+1); large.push_back(i); } else return 0; } int smallest = small[0]; for (int i = 1; i < small.size(); ++i) { int x = get(small[i], small[i], smallest, smallest); if (x == 1) smallest = small[i]; else if (x == -1) return 0; } int largest = large[0]; for (int i = 1; i < large.size(); ++i) { int x = get(largest, n, large[i], n); if (x == 1) largest = large[i]; else if (x == -1) return 0; } cout << "! " << smallest << ' ' << smallest << ' ' << largest << ' ' << n << '\n'; return 0; }