#include <bits/stdc++.h>
using namespace std;
const double pi = acosl(-1);
void solve() {
  long long n, s, t;
  cin >> n >> s >> t;
  if (n == s + t) {
    cout << max(s, t) + 1 << '\n';
  } else {
    if (2 * n == s + t) {
      cout << 1 << '\n';
    } else {
      if (s > t) {
        swap(s, t);
      }
      long long same = t - (n - s);
      cout << max(n - s, s - same) + 1 << '\n';
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tt = 1;
  cin >> tt;
  while (tt--) {
    solve();
  }
}
