#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=2005;
struct seg { int l,r; ll s; };
int n;
ll a[MAXN];
ll qry(int l,int r) {
	cout<<"? "<<l<<" "<<r<<endl;
	ll z; cin>>z; return z;
}
void solve() {
	cin>>n;
	vector <seg> p;
	for(int i=1;i<=n;++i) {
		a[i]=qry(i,i);
		if(p.size()&&(p.back().s>0)==(a[i]>0)) p.back().s+=a[i],p.back().r=i;
		else p.push_back({i,i,a[i]});
	}
	if(!p.front().s) p.erase(p.begin());
	if(!p.back().s) p.erase(--p.end());
	auto pop=[&](int l,int r) { p.erase(p.begin()+l,p.begin()+r+1); };
	while(p.size()>1) {
		int i=0;
		for(int j=0;j<(int)p.size();j+=2) if(p[j].s<p[i].s) i=j;
		if(i-2>=0) {
			ll x=qry(p[i-2].l,p[i].r);
			if(x>p[i-2].s) {
				a[p[i-1].l]=x-p[i-2].s-p[i].s;
				p[i-2].r=p[i].r,p[i-2].s=x,pop(i-1,i);
				continue;
			}
		}
		if(i+2<(int)p.size()) {
			ll x=qry(p[i].l,p[i+2].r);
			if(x>p[i+2].s) {
				a[p[i+1].l]=x-p[i+2].s-p[i].s;
				p[i+2].l=p[i].l,p[i+2].s=x,pop(i,i+1);
				continue;
			}
		}
		if(!i) a[p[i+1].l]=-p[i].s,pop(i,i+1);
		else if(i+1==(int)p.size()) a[p[i-1].l]=-p[i].s,pop(i-1,i);
		else a[p[i+1].l]=-p[i].s,p[i-1].r=p[i+1].r,pop(i,i+1);
	}
	cout<<"! "; for(int i=1;i<=n;++i) cout<<a[i]<<" "; cout<<endl;
}
signed main() {
	int T; cin>>T;
	while(T--) solve();
	return 0;
}