#include<bits/stdc++.h>
using namespace std;
using pi=pair<int,int>;
#define fi first
#define se second
int ct=0,k;
map<int,vector<int>>mp;
vector<int>query(vector<pi>c) {
    cout<<"? ";
    for(auto i:c)cout<<i.fi<<' '<<i.se<<' ';
    cout<<endl;
    vector<int>d(c.size()*k);
    for(int&i:d)cin>>i;
    return d;
}
vector<int>qry(vector<pi>c) {
    if(mp.count(c[0].se))return mp[c[0].se];
    return ct++,mp[c[0].se]=query(c);
}
vector<pi>solve(int n,int k,int lim) {
    vector<pi>as;
    auto slv=[&](auto&&_,int l,int r,vector<int>ls,vector<int>rs)->void {
        auto calc=[&](vector<int>c,int t)->vector<int> {
            map<int,int>lp,rp;
            vector<int>nc;
            for(int i:ls)lp[i+t-l]++;
            for(int i:rs)rp[i+r-t]++;
            for(int i:c) {
                if(lp[i])lp[i]--;
                else if(rp[i])rp[i]--;
                else nc.push_back(i);
            }return nc;
        };
        if(ls.size()+rs.size()==k)return;
        if(l==r) {
            vector<int>c=qry({{-n,l}});
            c=calc(c,l);
            for(int i:c)as.push_back({-n+i,l});
            return;
        }
        if(ls.size()+rs.size()==k-1) {
            vector<int>c1=qry({{-n,l}}),c2=qry({{-n,r}});
            c1=calc(c1,l),c2=calc(c2,r);
            int x=(c1[0]+c2[0]-(r-l))/2-n;
            return as.push_back({x,c1[0]-x-n+l});
        }
        int mid=l+r>>1;
        vector<int>c1=qry({{-n,mid}}),c2=qry({{-n,mid+1}}),nls=ls,nrs=rs;
        for(int&i:nls)i+=mid+1-l;
        for(int&i:nrs)i+=r-mid;
        c1=calc(c1,mid),c2=calc(c2,mid+1);
        map<int,int>v;
        for(int i:c2)v[i]++;
        sort(c1.begin(),c1.end());
        for(int i:c1) {
            if(v[i-1])nrs.push_back(i),v[i-1]--;
            else assert(v[i+1]),nls.push_back(i+1),v[i+1]--;
        }
        _(_,l,mid,ls,nrs),_(_,mid+1,r,nls,rs);
    };
    slv(slv,-n,n,{},{});
    sort(as.begin(),as.end());
    cerr<<ct<<'\n';
    return as;
}
int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int n,lim;
    cin>>n>>k>>lim;
    auto as=solve(n,k,lim);
    cout<<"! ";
    for(auto i:as)cout<<i.fi<<' '<<i.se<<' ';
    cout<<endl;
    return 0;
}