#include <bits/stdc++.h>
using namespace std;

using LL = long long;
const int N = 2005;

LL ask(int l, int r) {
  cout << "? " << l << " " << r << endl;
  LL v;
  cin >> v;
  return v;
}

int n;
LL a[N];

void ouf() {
  cout << "!";
  for (int i = 1; i <= n; ++i) cout << " " << a[i];
  cout << endl;
}

struct Node {
  mutable int l, r;
  mutable LL v;
  Node(int l, int r, LL v) : l(l), r(r), v(v) {}
  bool operator<(const Node &rhs) const {
    return l < rhs.l;
  }
};

void solve() {
  cin >> n;
  fill(a + 1, a + n + 1, 0);
  set<Node> s;
  for (int i = 1; i <= n; ++i) {
    a[i] = ask(i, i);
    if (a[i] <= 0) continue;
    if (i > 1 && a[i - 1] > 0) {
      s.rbegin()->r = i;
      s.rbegin()->v += a[i];
    } else {
      s.emplace(i, i, a[i]);
    }
  }
  if (!s.size()) return ouf();
  auto qs = [&](int l, int r) {
    return accumulate(a + l, a + r + 1, 0ll);
  };
  while (s.size()) {
    auto p = s.end();
    for (auto it = s.begin(); it != s.end(); ++it)
      if (p == s.end() || it->v < p->v) p = it;
    if (p != s.begin()) {
      auto i = prev(p);
      auto val = ask(i->l, p->r);
      if (val > i->v) {
        a[p->l - 1] = val - i->v - p->v - qs(i->r + 1, p->l - 1);
        Node nw(i->l, p->r, val);
        s.erase(i), s.erase(p), s.insert(nw);
        continue;
      } else {
        a[p->l - 1] = -p->v;
      }
    }
    if (next(p) != s.end()) {
      auto i = next(p);
      auto val = ask(p->l, i->r);
      if (val > i->v) {
        a[p->r + 1] = val - i->v - p->v - qs(p->r + 1, i->l - 1);
        Node nw(p->l, i->r, val);
        s.erase(i), s.erase(p), s.insert(nw);
        continue;
      } else {
        a[p->r + 1] = -p->v;
      }
    }
    s.erase(p);
  }
  ouf();
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}