#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  long long int i, j, k, l, m, n, q;
  cin >> q;
  long long int s, t, intersection, s_1, t_1;
  while (q--) {
    cin >> n >> s >> t;
    intersection = (s + t) - n;
    s_1 = s - intersection;
    t_1 = t - intersection;
    cout << max(s_1, t_1) + 1 << '\n';
  }
}
