#include int query(int l, int r, int ll, int rr) { int x; printf("? %d %d %d %d\n", l, r, ll, rr); fflush(stdout); scanf("%d", &x); return x; } int main() { int N, Q; scanf("%d %d", &N, &Q); int i, x, q[2][501] = {}, argmin, argmax; for (i = 1; i <= N; i += 2) { x = query(i, N, i + 1, N); if (x != 0) { q[0][i/2] = i; q[1][i/2] = i + 1; } else { q[0][i/2] = i + 1; q[1][i/2] = i; } } for (i = 1, argmin = q[0][0], argmax = q[1][0]; i < N / 2; i++) { x = query(argmin, argmin, q[0][i], q[0][i]); if (x == 0) argmin = q[0][i]; x = query(argmax, N, q[1][i], N); if (x != 0) argmax = q[1][i]; } printf("! %d %d %d %d\n", argmin, argmin, argmax, N); fflush(stdout); return 0; }