#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];
int midl[N][N],midr[N][N],res[N][N];
struct Node
{
	int l,r,val;
	Node(int a=0,int b=0,int c=0) {l=a,r=b,val=c;}
	bool operator < (const Node &x) const
	{
		if(l!=x.l) return r<x.r;
		else return l<x.l;
	}
};
void setvalue(int l,int r,int val)
{
	if(l==r) b[l]=val;
	else
	{
		assert(-val>=res[l][r]);
		int nl=midl[l][r],nr=midr[l][r];
		setvalue(l,nl-1,val);
		setvalue(nr+1,r,-res[l][r]);
	}
}
void work()
{
	cin>>n;
#ifdef xay5421
	n=100;
	for(int i=1;i<=n;i++) cin>>ANS[i];
	for(int i=1;i<=n;i++) ANS[i]=Rnd(-10,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++) for(int j=1;j<=n;j++) midl[i][j]=midr[i][j]=res[i][j]=0;
	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
	{
		set<Node> ranges;
		for(int i=1;i<=m;i++)
		{
			if(i&1) ranges.emplace(i,i,b[i]),res[i][i]=b[i];
			else ranges.emplace(i,i,-1);
		}
		auto getpre=[&](int l,int r)
		{
			auto it=ranges.lower_bound((Node){l,r,0});
			assert(it!=ranges.begin());
			it--;
			return it;
		};
		auto getsuf=[&](int l,int r)
		{
			auto it=ranges.lower_bound((Node){l,r,0});
			it++;
			assert(it!=ranges.end());
			return it;
		};
		int cL=1,cR=m;
		while(ranges.size()>1)
		{
			set<Node>::iterator mi; int mnv=inf;
			for(auto i=ranges.begin();i!=ranges.end();i++) if(i->val>0&&i->val<mnv) mnv=i->val,mi=i;
			// printf("working : %d %d\n",mi->l,mi->r);
			int ok=0;
			if(mi->l!=cL)
			{
				auto l1=getpre(mi->l,mi->r);
				auto l2=getpre(l1->l,l1->r);
				int q=qry(L[l2->l],R[mi->r]);
				if(q>mi->val&&q>l2->val)
				{
					setvalue(l1->l,l1->r,q-mi->val-l2->val);
					ok=1;
					int nl=l2->l,nr=mi->r,nv=q;
					ranges.erase(mi),ranges.erase(l1),ranges.erase(l2);
					ranges.emplace(nl,nr,nv);
				}
			}
			if(!ok&&mi->r!=cR)
			{
				auto r1=getsuf(mi->l,mi->r);
				auto r2=getsuf(r1->l,r1->r);
				int q=qry(L[mi->l],R[r2->r]);
				if(q>mi->val&&q>r2->val)
				{
					setvalue(r1->l,r1->r,q-mi->val-r2->val);
					ok=1;
					int nl=mi->l,nr=r2->r,nv=q;
					ranges.erase(mi),ranges.erase(r1),ranges.erase(r2);
					ranges.emplace(nl,nr,nv);
				}
			}
			if(!ok)
			{
				if(mi->l==cL)
				{
					auto r1=getsuf(mi->l,mi->r);
					setvalue(r1->l,r1->r,-mi->val);
					ranges.erase(mi),ranges.erase(r1);
					cL=ranges.begin()->l;
				}
				else if(mi->r==cR)
				{
					auto l1=getpre(mi->l,mi->r);
					setvalue(l1->l,l1->r,-mi->val);
					ranges.erase(mi),ranges.erase(l1);
					cR=ranges.rbegin()->r;
				}
				else
				{
					auto r1=getsuf(mi->l,mi->r);
					auto l1=getpre(mi->l,mi->r);
					int nl=l1->l,nr=r1->r;
					midl[nl][nr]=mi->l,midr[nl][nr]=mi->r,res[nl][nr]=mi->val;
					ranges.erase(mi),ranges.erase(l1),ranges.erase(r1);
					ranges.emplace(nl,nr,-1);
				}
			}
		}
		for(int i=1;i<=m;i++) if(i%2==0) 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"),exit(0);
	else printf("ac\n");
#endif
}
signed main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	int T; cin>>T; while(T--) work();
	return 0;
}