#include<bits/stdc++.h>
using namespace std;
int main()
{
	mt19937 rng((unsigned long long)(new char));
	int T;
	cin>>T;
	while(T--)
	{
		int n=rng()%15+1;
/*		
		vector<long long> b(n+5);
		for(int i=1;i<=n;i++)
		{
			if(i%2==1)b[i]=rng()%1000000000+1;
			else b[i]=-((int)(rng()%1000000000));
			//b[i]=(int)rng()%11-5;
			cerr<<b[i]<<" \n"[i==n];
		}
		auto mss=[&](const vector<long long> &v,int l,int r)
		{
			long long s=0,m=0;
			for(int i=l;i<=r;i++)
			{
				s+=v[i];
				if(s<0)s=0;
				m=max(m,s);
			}
			return m;
		};
*/		
		map<pair<int,int>,long long> rec;
		int cnt=0;
		auto query=[&](int l,int r)
		{
			if(rec.contains({l,r}))return rec[{l,r}];
			cout<<"? "<<l<<' '<<r<<endl;
			cnt++;
			long long res;
//			res=mss(b,l,r);
			cin>>res;
			return rec[{l,r}]=res;
		};
		cin>>n;
		vector<long long> a(n+5);
		for(int i=1;i<=n;i++)
		{
			a[i]=query(i,i);
		}
		struct element
		{
			int l,r;
			long long val;
		};
		vector<element> vec;
		int pre=1;
		long long sum=a[1];
		for(int i=2;i<=n;i++)
		{
			if(a[i]>0)
			{
				if(sum==0)
				{
					vec.emplace_back(pre,i-1,sum);
					pre=i;
					sum=a[i];
				}
				else
				{
					sum+=a[i];
				}
			}
			else
			{
				if(sum>0)
				{
					vec.emplace_back(pre,i-1,sum);
					pre=i;
					sum=a[i];
				}
				else
				{
					sum+=a[i];
				}
			}
		}
		vec.emplace_back(pre,n,sum);
		if(vec.front().val<=0)vec.erase(vec.begin());
		if(not vec.empty() and vec.back().val<=0)vec.pop_back();
		function<bool(int)> chk3=[&](int i)
		{
			if(i<0 or i+2>=(int)vec.size())return false;
//			cerr<<"chk3 "<<i<<endl;
			long long res=query(vec[i].l,vec[i+2].r);
			if(res>max(vec[i].val,vec[i+2].val))
			{
				long long newval=res-vec[i].val-vec[i+2].val;
				a[vec[i+1].r]+=newval-vec[i+1].val;
				//merge
				vec[i].r=vec[i+2].r;
				vec[i].val=res;
				vec.erase(vec.begin()+i+1,vec.begin()+i+3);
				return true;
			}
			else
			{
				long long newval=-min(vec[i].val,vec[i+2].val);
				a[vec[i+1].r]+=newval-vec[i+1].val;
				vec[i+1].val=newval;
				return false;
			}
		};
		while(vec.size()>1u)
		{
//			cerr<<"now vec :"<<endl;
//			for(auto [l,r,val]:vec)cerr<<l<<' '<<r<<' '<<val<<endl;
			int minpos=0;
			for(int i=0;i<(int)vec.size();i+=2)
			{
				if(vec[i].val<vec[minpos].val)
				{
					minpos=i;
				}
			}
			int i=minpos;
			if(i==0)
			{
				if(not chk3(i))
					vec.erase(vec.begin(),vec.begin()+2);
			}
			else if(i==(int)vec.size()-1)
			{
				if(not chk3(i-2))
					vec.erase(vec.end()-2,vec.end());
			}
			else
			{
				if(chk3(i-2))continue;
				if(chk3(i))continue;
				//merge
//				cerr<<"merge "<<i<<endl;
				vec[i-2].r=vec[i].r;
				vec[i-2].val+=vec[i-1].val+vec[i].val;
				vec.erase(vec.begin()+i-1,vec.begin()+i+1);
			}
		}
		cout<<"!";
		for(int i=1;i<=n;i++)
		{
			cout<<' '<<a[i];
		}
		cout<<endl;
		
		//check
		/*
		int ok=1;
		for(int l=1;l<=n;l++)
		{
			for(int r=l;r<=n;r++)
			{
				if(mss(b,l,r)!=mss(a,l,r))
				{
					cerr<<"BOOM "<<l<<' '<<r<<endl;
					ok=0;
				}
			}
		}
		assert(ok and cnt<=2*n);
		*/
	}
	
	return 0;
}