#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define D(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
using LL=long long;
mt19937_64 rnd((long long)new char);
int Rnd(int l,int r) {return rnd()%(r-l+1)+l;}
#define N 2005
#define int long long
const int inf=10000000000000;
int n,a[N],sgn[N];
int ANS[N];
int cnt=0;
int qry(int l,int r)
{
	printf("? %lld %lld\n",l,r); fflush(stdout);
#ifdef xay5421
	cnt++;
	int ans=0,cur=0;
	for(int i=l;i<=r;i++)
	{
		cur=max(cur+ANS[i],0LL);
		ans=max(ans,cur);
	}
	return ans;
#endif
	int w; cin>>w;
	return w;
}
int L[N],R[N],b[N],s[N],m;
int prew[N],pos[N];
void work()
{
	cin>>n;
#ifdef xay5421
	// n=7;
	for(int i=1;i<=n;i++) cin>>ANS[i];
	// for(int i=1;i<=n;i++) ANS[i]=Rnd(1,10);
	// for(int i=2;i<=n;i+=2) ANS[i]=-ANS[i];
	for(int i=1;i<=n;i++) printf("%lld%c",ANS[i]," \n"[i==n]);
	cnt=0;
#endif
	for(int i=1;i<=n;i++)
	{
		int w=qry(i,i);
		if(w>0) sgn[i]=1,a[i]=w;
		else sgn[i]=0,a[i]=0;
	}
	m=0;
	for(int i=1;i<=n;i++)
	{
		int r=i; while(r<n&&sgn[r+1]==sgn[i]) r++;
		if(m==0&&sgn[i]==0) continue;
		m++; s[m]=sgn[i],L[m]=i,R[m]=r,b[m]=0;
		if(sgn[i]==1)
		{
			for(int j=i;j<=r;j++) b[m]+=a[j];
		}
		i=r;
	}
	if(s[m]==0) m--;
	if(m==1)
	{
		printf("! ");
		for(int i=1;i<=n;i++) printf("%lld%c",a[i]," \n"[i==n]);
		fflush(stdout);
	}
	else
	{
		pos[2]=1,prew[2]=b[1];
		for(int i=4;i<=m;i+=2)
		{
			int w=qry(L[pos[i-2]],R[i-1]);
			if(w==prew[i-2]) pos[i]=i-1,prew[i]=b[i-1];
			else pos[i]=pos[i-2],prew[i]=w;
			// printf("%lld : %lld %lld\n",i,pos[i],prew[i]);
		}
		for(int i=m-1;i>=2;i-=2)
		{
			int sufw=0,cur=0,sufpos=m;
			for(int j=m;j>i;j--)
			{
				cur+=b[j];
				if(cur<0) cur=0,sufpos=j;
			}
			sufw=cur;
			int sw=qry(L[pos[i]],R[sufpos]);
			// printf("%d : %d %d %d\n",i,prew[i],sufw,sw);
			if(sw!=prew[i]&&sw!=sufw) b[i]=-prew[i]-sufw+sw;
			else b[i]=-min(prew[i],sufw);
		}
		for(int i=2;i<=m;i+=2) a[L[i]]=b[i];
		printf("! ");
		for(int i=1;i<=n;i++) printf("%lld%c",a[i]," \n"[i==n]);
		fflush(stdout);
	}
#ifdef xay5421
	for(int i=1;i<=n;i++)
	{
		int cur1=0,mxw1=0,cur2=0,mxw2=0;
		for(int j=i;j<=n;j++)
		{
			cur1=max(cur1+a[j],0LL);
			mxw1=max(mxw1,cur1);
			cur2=max(cur2+ANS[j],0LL);
			mxw2=max(mxw2,cur2);
			if(mxw1!=mxw2) printf("wa %lld %lld\n",i,j),exit(0);
		}
	}
	if(cnt>2*n) printf("tle\n");
	else printf("ac\n");
#endif
}
signed main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	int T; cin>>T; while(T--) work();
	return 0;
}