#include<bits/stdc++.h>

#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array

#define N 5005
#define inf 0x3f3f3f3f3f3f3f3f

using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(int x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

struct Node{
    int l,r,val;
    Node(int l=0,int r=0,int val=0):l(l),r(r),val(val){}
};
vector<Node> S;
int res[N];

void solve(){
    int n=read();S.clear();
    for(int i=1;i<=n;i++)res[i]=0;
    for(int i=1;i<=n;i++){
        cout<<'?'<<' '<<i<<' '<<i<<endl;
        res[i]=read();S.pb(Node(i,i,res[i]));
    }
    for(int i=0;i<S.size();i++){
        while(i+1<S.size() && (S[i+1].val<=0)==(S[i].val<=0)){
            S[i].r=S[i+1].r;S[i].val+=S[i+1].val;
            S.erase(S.begin()+i+1);
        }
    }
    while(S.size()!=1){
        if(S.back().val==0)S.pop_back();
        else if(S[0].val==0)S.erase(S.begin());
        else{
            pi minn=mp(inf,0);
            for(int i=0;i<S.size();i++){
                (minn<mp(S[i].val,i))?minn=mp(S[i].val,S[i].l):minn;
            }
            if(minn.se==0){
                cout<<'?'<<' '<<S[0].l<<' '<<S[2].r<<endl;
                int now=read();
                if(now!=S[0].val && now!=S[2].val){
                    res[S[1].l]=now-S[0].val-S[2].val;
                    int L=S[0].l,R=S[2].r;S.erase(S.begin());S.erase(S.begin());
                    S[0].l=L;S[0].val=now;
                }
                else{
                    res[S[1].l]=-S[0].val;S.erase(S.begin());S.erase(S.begin());
                }
            }
            else if(minn.se==S.size()-1){
                int las=S.size()-1;
                cout<<'?'<<' '<<S[las-2].l<<' '<<S[las].r<<endl;
                int now=read();
                if(now!=S[las-2].val && now!=S[las].val){
                    res[S[las-1].l]=now-S[las-2].val-S[las].val;
                    int L=S[las-2].l,R=S[las].r;S.pop_back();S.pop_back();
                    S[S.size()-1].r=R;S[S.size()-1].val=now;
                }
                else{
                    res[S[las-1].l]=-S[las].val;S.pop_back();S.pop_back();
                }
            }
            else{
                int pos=minn.se;
                cout<<'?'<<' '<<S[pos-2].l<<' '<<S[pos].r<<endl;
                int now=read();
                if(now!=S[pos-2].val && now!=S[pos].val){
                    res[S[pos-1].l]=now-S[pos].val-S[pos-2].val;
                    int R=S[pos].r;S.erase(S.begin()+pos-1);S.erase(S.begin()+pos-1);
                    S[pos-2].val=now;S[pos-2].r=R;continue;
                }
                cout<<'?'<<' '<<S[pos].l<<' '<<S[pos+2].r<<endl;
                if(now!=S[pos].val && now!=S[pos+2].val){
                    res[S[pos+1].l]=now-S[pos].val-S[pos+2].val;
                    int R=S[pos+2].r;S.erase(S.begin()+pos+1);S.erase(S.begin()+pos+1);
                    S[pos].val=now;S[pos].r=R;continue;
                }
                res[S[pos+1].l]=-S[pos].val;int R=S[pos+1].r;
                S.erase(S.begin()+pos);S.erase(S.begin()+pos);
                S[pos-1].r=R;
            }
        }
    }
    cout<<'!'<<' ';
    for(int i=1;i<=n;i++)write(res[i]),putchar(' ');
    cout<<endl;
}

int main(){
    int T=read();while(T--)solve();
    
}