#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200009;
const long long MOD = 119 << 23 | 1;
class {
 public:
  void solve() {
    int t;
    cin >> t;
    while (t--) {
      int n, a, b;
      cin >> n >> a >> b;
      if (a > b) swap(a, b);
      int T = b - 1, TT, TTT;
      if (b + 1 <= n)
        TT = n - b - 1, TTT = 1;
      else
        TTT = TT = 0;
      int ans1 = 0;
      if (a - 1 <= TT)
        ans1 += a - 1, TT -= a - 1;
      else
        ans1 += TT, TT = 0;
      if (a + 1 <= n && TTT) ans1 += 1;
      if (a + 2 <= n) {
        if (n - a - 1 <= T)
          ans1 += n - a - 1;
        else {
          ans1 += T;
          int l = n - a - 1 - T;
          ans1 += min(TT, l);
        }
      }
      int ans2 = 0;
      T = b - 1, TT = n - b;
      if (n - a >= T)
        ans2 += T, T = 0;
      else
        ans2 += n - a, T -= n - a;
      ans2 += min(T + TT, a - 1);
      cout << n - ans1 << " " << ans2 + 1 << '\n';
    }
  }
} NSPACE;
int main() {
  ;
  ios_base::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  NSPACE.solve();
}
