#include <bits/stdc++.h>
#define pii pair<int,int>
#define X first
#define Y second
using namespace std;
const int bor = 1e8;
const int N=1e6+5;
int b,k,w,d;
int D[N];
set<pii> ta;
vector<pii> a;
set<int> s,key;
vector<pii> ques;
multiset<int> res;
int dis[N];
int Dis(pii u,pii v){
    return abs(u.X-v.X)+abs(u.Y-v.Y);
}
bool chk(int i,int dx,int dy){
    pii u = a[i];
    pii p = {u.X+dx,u.Y+dy};
    int dt = Dis(u,p);
    if(p.X < -bor || p.X > bor || p.Y < -bor || p.Y > bor) return false;
    for(int j=0;j<a.size();j++){
        pii v = a[j];
       // if(i<j && Dis(v,p)==dt) printf("%d %d %d %d %d %d %d\n",dt,u.X,u.Y,v.X,v.Y,p.X,p.Y);
        if(key.count(Dis(v,p)) || i<j&&Dis(v,p)==dt) return false;
    }
    //printf("%d %d\n",p.X,p.Y);
    key.insert(dt);
    for(int j=0;j<a.size();j++)
        s.insert(Dis(a[j],p));
    ques.push_back(p);
    return true;
}
int main(){
    scanf("%d%d%d",&b,&k,&w);
    printf("? %d %d %d %d\n",-b,-b,-b,b);
    fflush(stdout);
    for(int i=1;i<=k*2;i++)
        scanf("%d",&D[i]);
    for(int i=1;i<=k*2;i++)
        for(int j=1;j<=k*2;j++){
            ta.insert({(D[i]+D[j])/2-b*2,(D[i]-D[j])/2});
        }
    while(ta.size()){
        pii p = *ta.begin();
        ta.erase(p);
        if(p.X < -b || p.X > b || p.Y < -b || p.Y > b) continue;
        a.push_back(p);
        // printf("%d %d\n",p.X,p.Y);
    }
    for(int i=0;i<a.size();i++){
        pii p = a[i];
        while(s.count(d) || (!chk(i,-d,0) && !chk(i,d,0) && !chk(i,0,-d) && !chk(i,0,d))) 
            d++;
        dis[i] = d;
    }
    printf("? ");
    for(pii p:ques) printf("%d %d ",p.X,p.Y);
    puts(""); fflush(stdout);
    for(int i=1;i<=ques.size()*k;i++){
        int x; scanf("%d",&x);
        res.insert(x);
    }
    printf("! ");
    for(int i=0;i<a.size();i++){
        pii u = a[i];
        if(res.find(dis[i])!=res.end()){
            printf("%d %d ",u.X,u.Y);
            for(pii q:ques){
                res.erase(Dis(u,q));
            }
        }
    }
    fflush(stdout);
    return 0;
}