#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];
int cts=0;
ll qry(int x,int y){
	if(f[x][y]^-INF) return f[x][y];
	cts++;assert(cts<=2*n);
	ll z;cout<<"? "<<x<<' '<<y<<endl;
	fflush(stdout);
	cin>>z;return f[x][y]=z;
}
int id[N],ih,op[N],l[N],r[N],pl[N],pr[N];ll B[N];
ll sl[N],prel[N],sr[N],prer[N];
void Solve(){
	int i,j;cin>>n;cts=0;
	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);
	ih=0;
	for(i=1;i<=n&&!A[i];i++) A[i]=-1e15;
	for(i=n;i&&!A[i];i--) A[i]=-1e15;
	for(i=1;i<=n;i++){
		if(A[i]>0) id[++ih]=i,B[ih]=A[i],op[ih]=0;
		else if(!A[i]){
			if(A[i-1]) id[++ih]=i,B[ih]=0,op[ih]=1;
		}
	}
	for(i=1;i<=ih;i++) if(op[i]) l[i]=r[i]=i,pl[i]=pr[i]=i;
	while(1){
		for(i=1;i<=ih;i++)if(op[i]){
			ll tot=0,sum=0;
			sr[i]=prer[i]=-1e18;
			for(j=i+1;j<=ih&&!op[j];j++){
				tot+=B[j];
				sum=max(sum+B[j],0ll);
				prer[j]=max(prer[j-1],tot);
				sr[j]=max(sr[j-1],sum);
			}
		}
		for(i=ih;i;i--) if(op[i]){
			ll tot=0,sum=0;
			sl[i]=prel[i]=-1e18;
			for(j=i-1;j&&!op[j];j--){
				tot+=B[j];
				sum=max(sum+B[j],0ll);
				prel[j]=max(prel[j+1],tot);
				sl[j]=max(sl[j+1],sum);
			}
		}
		int flag=0;
		for(i=1;i<=ih;i++) if(op[i]){
			while(l[i]>1&&!op[l[i]-1]){
				l[i]--;
				for(int j=i+1;j<=r[i];j++){
					if(prer[j]+prel[l[i]]-max(sr[j],sl[l[i]])>prer[pr[i]]+prel[pl[i]]-max(sr[pr[i]],sl[pl[i]])) pr[i]=j,pl[i]=l[i];
				}
			}
			while(r[i]<ih&&!op[r[i]+1]){
				r[i]++;
				for(int j=i-1;j>=l[i];j--){
					if(prer[r[i]]+prel[j]-max(sr[r[i]],sl[j])>prer[pr[i]]+prel[pl[i]]-max(sr[pr[i]],sl[pl[i]])) pr[i]=r[i],pl[i]=j;
				}
			}
			gdb(pl[i],pr[i]);
			if(qry(id[pl[i]],id[pr[i]])>max(sr[pr[i]],sl[pl[i]])){
				op[i]=0;B[i]=qry(id[pl[i]],id[pr[i]])-prer[pr[i]]-prel[pl[i]];
				flag=1;break;
			}
		}
		if(!flag){
			for(int i=1;i<=ih;i++)if(op[i]){
				B[i]=qry(id[pl[i]],id[pr[i]])-prer[pr[i]]-prel[pl[i]];
				op[i]=0;
				flag=1;break;
			}
		}
		if(!flag) break;
	}
	for(i=1;i<=ih;i++) A[id[i]]=B[i];
	cout<<"! ";for(i=1;i<=n;i++) cout<<A[i]<<' ';cout<<endl;fflush(stdout);
}
int main(){
	// freopen("1.in","r",stdin);freopen("1.out","w",stdout);
	int t=1;
	cin>>t;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}