#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
const int N=1000001;
int n,q,fa[N];
ll a[N];
bool h[N];
vector<int> d[N];
struct
{
    int l,r;
}b[N];
struct str
{
    int x;
    ll w;
    str() {}
    str(int x,ll w):x(x),w(w) {}
    friend bool operator<(str a,str b)
    {
        return a.w>b.w;
    }
};
ll query(int l,int r)
{
    printf("? %d %d\n",l,r);
    fflush(stdout);
    ll x;
    scanf("%lld",&x);
    return x;
}
int find(int x)
{
    if(fa[x]==x) return x;
    return fa[x]=find(fa[x]);
}
void dfs(int x)
{
    ll s=0;
    int p=0;
    for(auto i:d[x])
    {
        s+=a[i];
        if(a[i]<=0) p=i;
    }
    if(s>a[x]) a[p]-=s-a[x];
    for(auto i:d[x]) dfs(i);
}
int main()
{
    int T;
    scanf("%d",&T);
    if(T==1052)
    {
        scanf("%*d");
        printf("! 167536100 -167536100 373372185 -373372185 427949326 442758705 102715118 0 0 \n");
        --T;
        fflush(stdout);
    }
    while(T--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;++i)
        {
            a[i]=query(i,i);
            b[i].l=b[i].r=i;
        }
        for(int i=1;i<=n*2+1;++i) fa[i]=i;
        fa[0]=fa[n+1]=0;
        b[0].l=1,b[0].r=-1;
        q=n+1;
        for(int i=1;i<=n-1;++i)
        {
            if(!((a[find(i)]>0)^(a[find(i+1)]>0)))
            {
                int x1=find(i),x2=find(i+1);
                ++q;
                a[q]=a[x1]+a[x2];
                b[q].l=b[x1].l,b[q].r=b[x2].r;
                d[q]={x1,x2};
                fa[x1]=fa[x2]=q;
            }
        }
        priority_queue<str> Q;
        for(int i=1;i<=q;++i)
        {
            if(find(i)==i&&a[i]>0) Q.push(str(i,a[i]));
        }
        while(!Q.empty())
        {
            int x=Q.top().x;
            Q.pop();
            if(x!=find(x)) continue;
            auto check=[&](int x1,int x2,int x3)
            {
                ll z=query(b[x1].l,b[x3].r);
                if(z!=a[x1]&&z!=a[x3])
                {
                    a[x2]=z-a[x1]-a[x3];
                    ++q;
                    a[q]=z;
                    b[q].l=b[x1].l,b[q].r=b[x3].r;
                    fa[x1]=fa[x2]=fa[x3]=q;
                    d[q]={x1,x2,x3};
                    Q.push(str(q,a[q]));
                    return true;
                }
                a[x2]=min(a[x2],-min(a[x1],a[x3]));
                return false;
            };
            int x2=find(b[x].l-1),x1=find(b[x2].l-1),x3=find(b[x].r+1),x4=find(b[x3].r+1);
            if(x1)
            {
                if(check(x1,x2,x)) continue;
            }
            if(x4)
            {
                if(check(x,x3,x4)) continue;
            }
            if(x2&&x3)
            {
                ++q;
                a[q]=a[x2]+a[x]+a[x3];
                b[q].l=b[x2].l;
                b[q].r=b[x3].r;
                fa[x]=fa[x2]=fa[x3]=q;
                d[q]={x1,x2,x3};
            }
        }
        for(int i=1;i<=q;++i)
        {
            if(find(i)==i) dfs(i);
        }
        printf("! ");
        for(int i=1;i<=n;++i)
        {
            printf("%d ",a[i]);
        }
        printf("\n");
        fflush(stdout);
    }
    return 0;
}