#include <bits/stdc++.h>
template <class T>
std::vector<T> ReadVector(size_t size) {
  std::vector<T> vector(size);
  for (auto& element : vector) {
    std::cin >> element;
  }
  return vector;
}
int64_t divisor(int64_t x) {
  for (int64_t d = 2; d * d <= x; ++d) {
    while (x % d == 0) {
      x /= d;
      return d;
    }
  }
  return x;
}
void YES(bool yes) {
  if (yes) {
    std::cout << "YES\n";
  } else {
    std::cout << "NO\n";
  }
}
class Solver {
 public:
  Solver() {}
  void solve() {
    int t;
    std::cin >> t;
    while (t--) {
      one();
    }
  }
  int lo(int& a, int& d) {
    if (a + d == 0) return 0;
    int losers = 0;
    if (d > a) {
      int m = std::max(0, a);
      losers += m;
      d -= m;
      a -= m;
    } else if (d < a) {
      int m = std::max(0, d - 1);
      losers += m;
      a -= m;
      d -= m;
    } else {
      losers += d - 1;
      d = 1;
      a = 1;
    }
    return losers;
  }
  int wi(int& a, int& d) {
    int winners = 0;
    if (d > a) {
      int m = a;
      winners += m;
      d -= m;
      a = 0;
    } else if (d < a) {
      int m = d;
      winners += m;
      a -= m;
      d = 0;
    } else {
      winners += d;
      d = 0;
      a = 0;
    }
    return winners;
  }
  void one() {
    int n, x, y;
    std::cin >> n >> x >> y;
    if (x > y) std::swap(x, y);
    int a = x - 1;
    int b = n - x;
    int c = y - 1;
    int d = n - y;
    int losers = 0;
    losers += lo(a, d);
    losers += lo(c, b);
    losers += std::min(b, d);
    a = x - 1;
    b = n - x;
    c = y - 1;
    d = n - y;
    int winners = 1;
    winners += wi(a, d);
    winners += wi(c, b);
    winners += std::min(a, c);
    std::cout << n - losers << " " << winners << std::endl;
  }
};
int main() {
  Solver solver;
  solver.solve();
  return 0;
}
