#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
#define INF 1e15

struct node{
    int l;
    int r;
    LL sum;
    node(){}
    node(int _l,int _r,LL _sum){
        l=_l;
        r=_r;
        sum=_sum;
    }
};

int main()
{
    int _=1;
    cin>>_;
    while (_--){
        int n;
        cin>>n;
        vector <LL> a(n+10,0);
        for (int i=1;i<=n;i++){
            cout<<"? "<<i<<" "<<i<<'\n';
            cin>>a[i];
        }
        int l=1,tp=a[1];
        LL sum=0;
        vector <node> z;
        for (int i=1;i<=n;i++){
            if (!a[i]){
                if (tp){
                    z.push_back(node(l,i-1,sum));
                    tp=0;
                    l=i;
                }
                sum=0;
            }
            else{
				if (!tp){
					z.push_back(node(l,i-1,sum));
					tp=a[i];
					l=i;
				}
				sum+=a[i];
			}
        }
        z.push_back(node(l,n,sum));
        LL mss=0,res;
        for (int i=0;i<(int)z.size()-2;i++){
			if (!z[i].sum) continue;
			mss=max({z[i].sum,z[i+2].sum,mss});
			cout<<"? "<<z[i].l<<" "<<z[i+2].r<<'\n';
			cin>>res;
			if (res==mss) a[z[i+1].l]=-INF;
			else a[z[i+1].l]=-z[i].sum-z[i+2].sum+res;
			if (z[i+2].sum==mss) mss=res;
			if (z[i+2].sum==mss&&res>mss) z[i+2].sum=res;
		}
		cout<<"! ";
		for (int i=1;i<=n;i++) cout<<a[i]<<" ";
		cout<<'\n';
    }
}