#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
const long long INF = 9 * 1e18;
using namespace std;
void solve() {
  long long lb, ub, n, a, b, Min, Max, a1, b1, flag = 0;
  cin >> n >> a >> b;
  Min = 1, Max = min(a + b - 1, n);
  ub = (Max - Min + 1) + 1;
  if (a >= Min && a <= Max) {
    ub--;
    flag++;
  }
  if (b >= Min && b <= Max) {
    ub--;
    flag++;
  }
  a1 = Max + Min - a, b1 = Max + Min - b;
  if (a1 + b1 <= (a + b) && flag == 2) ub++;
  flag = 0;
  Min = 1, Max = n;
  if (Min + Max <= (a + b)) {
    Min = (a + b + 1) - Max;
  }
  lb = (Max - Min + 1);
  if (a >= Min && a <= Max) {
    lb--;
    flag++;
  }
  if (b >= Min && b <= Max) {
    lb--;
    flag++;
  }
  a1 = Max + Min - a, b1 = Max + Min - b;
  if (a1 + b1 > (a + b) && flag == 2) lb++;
  cout << n - lb << " " << ub << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long q = 1;
  cin >> q;
  while (q--) {
    solve();
  }
  return 0;
}
