/*胡金梁*/
#include<bits/stdc++.h>
using namespace std;
#define __MY_TEST__ 0
#define int long long
inline int read()
{
	int f=1,re=0;
	char ch=getchar();
	while(!isdigit(ch)){ if(ch=='-') f=-1; ch=getchar();}
	while( isdigit(ch)) re=(re<<3)+(re<<1)+(ch^'0'),ch=getchar();
	return re*f;
}
const int N=2005;
struct Node
{
	int l,r,val;
};
int n;
int a[N];
int query(int l,int r)
{
	cout<<"? "<<l<<" "<<r<<endl;
	return read();
}
void work()
{
	n=read();
	vector<Node>vec;
	for(int i=1;i<=n;i++)
	{
		a[i]=query(i,i);
		if(vec.size()&&(vec.back().val>0)==(a[i]>0))
			vec.back().val+=a[i],vec.back().r=i;
		else
			vec.push_back({i,i,a[i]});
	}
	if(!vec.front().val) vec.erase(vec.begin());
	if(!vec.back().val) vec.erase(--vec.end());
	auto pop=[&](int l,int r){vec.erase(vec.begin()+l,vec.begin()+r+1);};
	while(vec.size()>1)
	{
		int pos=0;
		for(int i=0;i<vec.size();i+=2) if(vec[i].val<vec[pos].val) pos=i;
		if(pos-2>=0)
		{
			int x=query(vec[pos-2].l,vec[pos].r);
			if(x>vec[pos-2].val)
			{
				a[vec[pos-1].l]=x-vec[pos-2].val-vec[pos].val;
				vec[pos-2].r=vec[pos].r,vec[pos-2].val=x,pop(pos-1,pos);
				continue;
			}
		}
		if(pos+2<vec.size())
		{
			int x=query(vec[pos].l,vec[pos+2].r);
			if(x>vec[pos+2].val)
			{
				a[vec[pos+1].l]=x-vec[pos+2].val-vec[pos].val;
				vec[pos+2].l=vec[pos].l,vec[pos+2].val=x,pop(pos,pos+1);
				continue;
			}
		}
		if(!pos) a[vec[pos+1].l]=-vec[pos].val,pop(pos,pos+1);
		else if(pos+1==vec.size()) a[vec[pos-1].l]=-vec[pos].val,pop(pos-1,pos);
		else a[vec[pos+1].l]=-vec[pos].val,vec[pos-1].r=vec[pos+1].r,pop(pos,pos+1); 
	}
	cout<<"! ";
	for(int i=1;i<=n;i++)
	{
		cout<<a[i]<<" ";
	}
	cout<<endl;
}
signed main()
{
#if __MY_TEST__
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int t=read();
	while(t--) work(); 
}