#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int n;
int query(int l, int r) {
  cout << "? " << l+1 << " " << n << " " << r+1 << " " << n << endl;
  int t;
  cin >> t;
  return t; 
};

int main()
{
    int q;
    cin >> n >> q;
    vector<int> x;
    vector<int> s, t;
    for(int i=0;i<n;i+=2) {
      int ret = query(i,i+1);
      if(ret==1) {
        s.push_back(i);
        t.push_back(i+1);
      }
      else{
        s.push_back(i+1);
        t.push_back(i);
      }
    }
    while(s.size()!=1) {
      int m = s.size();
      vector<int> ns;
      for(int i=0;i+1<m;i+=2) {
        int ret = query(s[i],s[i+1]);
        if(ret==1) ns.push_back(s[i]);
        else ns.push_back(s[i+1]);
      }
      if(m%2==1) ns.push_back(s.back());
      swap(ns,s);
    }
    while(t.size()!=1) {
      int m = t.size();
      vector<int> nt;
      for(int i=0;i+1<m;i+=2) {
        int ret = query(t[i],t[i+1]);
        if(ret==0) nt.push_back(t[i]);
        else nt.push_back(t[i+1]);
      }
      if(m%2==1) nt.push_back(t.back());
      swap(nt,t);
    }
    cout << "! " << s[0]+1 << " " << s[0]+1 << " " << t[0]+1 << " " << n << endl;
    return 0;
}