#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long fast_exp(long long a, long long b) {
  if (b <= 0)
    return 1;
  else {
    long long res = 1;
    res = fast_exp(a, b / 2);
    res = (res * res) % mod;
    if (b % 2 == 1) res = (res * a) % mod;
    return res;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n, x, y;
    cin >> n >> x >> y;
    int worst = 0, best = 0;
    int by = max(0, n - y), bx = max(0, n - x);
    int ay = y - 1, ax = x - 1;
    int uby = min(max(by - 1, 0), ax);
    ax -= uby;
    by -= uby;
    int ubx = min(max(bx - 1, 0), ay);
    ay -= ubx;
    bx -= ubx;
    best += uby + ubx + min(bx, by);
    best = n - best;
    ay = y - 1, ax = x - 1;
    by = max(0, n - y), bx = max(0, n - x);
    worst += min(ax, by);
    ax -= min(ax, by);
    worst += min(bx, ay);
    ay -= min(ay, bx);
    worst += min(ay, ax) + 1;
    cout << best << ' ' << worst << endl;
  }
  return 0;
}
