#include<bits/stdc++.h>
using namespace std;

using ll = long long;
bool deb = 1;
int N,Q;
int ask(int l,int r){
    cout<<"? "<<l<<" "<<N<<" "<<r<<" "<<N<<endl;
    int X;
    cin>>X;

    return X;
}

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin>>N>>Q;
    queue<int> B[2],S;
    for(int i=1;i<N;i+=2){
        int x=ask(i,i+1);
        B[x].push(i+1);
        B[1-x].push(i);
    }
    for(int i=0;i<2;i++){
        while(B[i].size()>1){
            int p=B[i].front();
            B[i].pop();
            int q=B[i].front();
            B[i].pop();
            B[i].push(ask(p,q)!=i?p:q);
        }
    }
    cout<<"! "<<B[0].front()<<" "<<B[0].front()<<" "<<B[1].front()<<" "<<N<<"\n";
}