#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e3+5,M=1.5e8+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-8;const ll INF=1e18+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n;ll A[N];
ll f[N][N];
ll qry(int x,int y){
	if(f[x][y]^-INF) return f[x][y];
	ll z;cout<<"? "<<x<<' '<<y<<endl;
	fflush(stdout);
	cin>>z;return f[x][y]=z;
}
int l[N],r[N],Bh;ll B[N];
void remove(int x,int y){
	rotate(l+x,l+y+1,l+Bh+1);
	rotate(r+x,r+y+1,r+Bh+1);
	rotate(B+x,B+y+1,B+Bh+1);
	Bh-=y-x+1;
}
void Solve(){
	int i,j;cin>>n;
	for(i=1;i<=n;i++) for(j=1;j<=n;j++) f[i][j]=-INF;
	for(i=1;i<=n;i++) A[i]=qry(i,i);
	for(i=1;i<=n&&!A[i];i++) A[i]=-1e15;
	for(i=n;i&&!A[i];i--) A[i]=-1e15;
	Bh=0;
	for(i=1;i<=n;i++){
		if(A[i]>0){
			if(B[Bh]) B[Bh]+=A[i],r[Bh]=i;
			else B[++Bh]=A[i],l[Bh]=r[Bh]=i;
		}
		else if(!A[i]){
			if(B[Bh]) B[++Bh]=0,l[Bh]=r[Bh]=i;
			else r[Bh]=i;
		}
	}
	for(i=1;i<=Bh;i++) gdb(l[i],r[i]);
	while(Bh>1){
		int flag=0;
		int mi=1;for(int i=1;i<=Bh;i+=2) if(B[i]<B[mi]) mi=i;
		for(int i=max(mi-1,2);i<=min(mi+1,Bh-1);i+=2){
			if(qry(l[i-1],r[i+1])^max(B[i-1],B[i+1])){
				ll w=qry(l[i-1],r[i+1]);
				A[l[i]]=w-B[i-1]-B[i+1];
				r[i-1]=r[i+1];B[i-1]=w;
				remove(i,i+1);
				flag=1;break;
			}
		}
		if(flag) continue;
		if(mi==1){A[l[2]]=-1e15;remove(1,2);continue;}
		if(mi==Bh){A[l[Bh-1]]=-1e15;remove(Bh-1,Bh);continue;}
		A[l[mi+1]]=-B[mi];
		r[mi-1]=r[mi+1];
		remove(mi,mi+1);
	}
	cout<<"! ";for(i=1;i<=n;i++) cout<<A[i]<<' ';cout<<endl;fflush(stdout);
}
int main(){
	int t=1;
	cin>>t;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}