#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2010;
int n, a[N];
inline int Query(int l, int r) {
    cout << "? " << l << ' ' << r << endl;
    int ans = 0;
    cin >> ans;
    return ans;
}
inline void UpdMin(int &x, int y) {
    x = min(x, y);
}
signed main() {
    int Case;
    cin >> Case;
    while (Case--) {
        cin >> n;
        for (int i = 1; i <= n; ++i) a[i] = 1e15;
        for (int round = 0; round < 2; ++round) {
            for (int i = 1, la = 1, lasum = 0; i <= n; ++i) {
                int rst = (round ? Query(n - i + 1, n - la + 1): Query(la, i));
                if (rst == 0) {
                    UpdMin(a[i], -lasum);
                    la = i + 1;
                    lasum = 0;
                } else {
                    UpdMin(a[i], rst - lasum);
                    lasum = rst;
                }
            }
            reverse(a + 1, a + n + 1);
        }
        cout << "!";
        for (int i = 1; i <= n; ++i) cout << ' ' << a[i];
        cout << endl;
    }
    return 0;
}