#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i< (int)(n); i++) 

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, q; cin >> n >> q;
    set<int> high, low;
    for(int i=1; i+1<=n; i+=2){
        cout << "? " << i << " " << i << " " << i+1 << " " << i+1 << endl;
        int j; cin >> j;
        if(j == -1){
            return 0;
        }
        if(j == 1){
            high.insert(i+1);
            low.insert(i);
        }else{
            high.insert(i);
            low.insert(i+1);
        }
    }
    if(n % 2 != 0){
        high.insert(n);
        low.insert(n);
    }
    while(low.size() > 1){
        queue<int> que;
        while(low.size() > 0){
            que.push(*low.begin());
            low.erase(*low.begin());
        }
        while(que.size() > 1){
            int a = que.front(); que.pop();
            int b = que.front(); que.pop();
            cout << "? " << a << " " << a << " " << b << " " << b << endl;
            int j; cin >> j;
            if(j == -1){
                return 0;
            }
            if(j == 0){
                low.insert(b);
            }else{
                low.insert(a);
            }
        }
        while(!que.empty()){
            low.insert(que.front()); que.pop();
        }
    } 

    while(high.size() > 1){
        queue<int> que;
        while(high.size() > 0){
            que.push(*high.begin());
            high.erase(*high.begin());
        }
        while(que.size() > 1){
            int a = que.front(); que.pop();
            int b = que.front(); que.pop();
            cout << "? " << a << " " << n << " " << b << " " << n << endl;
            int j; cin >> j;
            if(j == -1){
                return 0;
            }
            if(j == 0){
                high.insert(a);
            }else{
                high.insert(b);
            }
        }
        while(!que.empty()){
            high.insert(que.front()); que.pop();
        }
    } 

    cout << "! " << *low.begin() << " " << *low.begin() << " " << *high.begin() << " " << n << endl;

    return 0;
}