#include<iostream>
#include<vector> 
using namespace std;
struct number
{
	int l,r;
	long long x;
};
int T,n;
vector<number> a;
long long ans[2010];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>T;
	while(T--)
	{
		cin>>n;
		a.resize(n);
		for(int i=1;i<=n;i++)
		{
			cout<<"? "<<i<<" "<<i<<endl;
			cin>>ans[i];
			a[i-1]={i,i,ans[i]};
		}
		for(int i=a.size()-1;i;i--)
		{
			if((a[i-1].x<=0)==(a[i].x<=0))
			{
				a[i-1].x+=a[i].x,a[i-1].r=a[i].r;
				a.erase(a.begin()+i);
			}
		}
		while(a.size()>1)
		{
			if(!a.back().x)
			{
				a.pop_back();
				continue;
			}
			if(!a[0].x)
			{
				a.erase(a.begin());
				continue;
			}
			pair<long long,int> minn={1e18,0};
			for(int i=0;i<a.size();i+=2)
			{
				minn=min(minn,{a[i].x,i});
			}
			int p=minn.second;
			if(p)
			{
				cout<<"? "<<a[p-2].l<<" "<<a[p].r<<endl;
				long long x;
				cin>>x;
				if(x>a[p-2].x)
				{
					ans[a[p-1].l]=-(a[p-2].x+a[p].x-x);
					number t={a[p-2].l,a[p].r,x};
					a.erase(a.begin()+p-2,a.begin()+p+1);
					a.insert(a.begin()+p-2,t);
					continue;
				}
			}
			if(p+2<a.size())
			{
				cout<<"? "<<a[p].l<<" "<<a[p+2].r<<endl;
				long long x;
				cin>>x;
				if(x>a[p+2].x)
				{
					ans[a[p+1].l]=-(a[p].x+a[p+2].x-x);
					number t={a[p].l,a[p+2].r,x};
					a.erase(a.begin()+p,a.begin()+p+3);
					a.insert(a.begin()+p,t);
					continue;
				}
			}
			if(!p)
			{
				ans[a[1].l]=-a[0].x;
				a.erase(a.begin(),a.begin()+2);
				continue;
			}
			if(p+1==a.size())
			{
				ans[a[p-1].l]=-a.back().x;
				a.erase(a.end()-2,a.end());
				continue;
			}
			ans[a[p+1].l]=-a[p].x,a[p-1].r=a[p+1].r;
			a.erase(a.begin()+p,a.begin()+p+2);
		}
		cout<<"! ";
		for(int i=1;i<=n;i++)
		{
			cout<<ans[i]<<" ";
		}
		cout<<endl;
	}
	return 0;
}