#include <bits/stdc++.h>
using namespace std;
const int ms = 2e5 + 100;
const int mod = 1e9 + 7;
const int inf = 1e9;
const int sigma = 30;
int n, m, k, t = 1;
string s;
int a, b;
bool Iwin(int pt) { return pt > (a + b); }
bool check(int first) { return Iwin(first + 1); }
int biggestSolution(int l, int r) {
  while (r - l > 1) {
    int m = (l + r) / 2;
    if (!check(m))
      l = m;
    else
      r = m;
  }
  return !check(r) ? r : l;
}
bool check2(int first) { return Iwin(n + first); }
int smallestSolution2(int l, int r) {
  while (l < r) {
    int m = (l + r) / 2;
    if (check2(m))
      r = m;
    else
      l = m + 1;
  }
  return l;
}
void solve() {
  cin >> n >> a >> b;
  int pt = a + b;
  int minimo = smallestSolution2(1, n);
  int maximo = biggestSolution(1, n);
  cout << minimo << ' ' << maximo << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> t;
  while (t--) {
    solve();
  }
}
