#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = (a); i <= (n); i++)
#define per(i, a, n) for (int i = (n); i >= (a); i--)
#define pb push_back
#define chmx(a, b) a = max(a, b)
#define chmn(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define x first
#define y second
#define lowbit(x) ((x) & (-x))
#define SZ(x) ((int)(x).size())
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;
typedef long double LD;
typedef pair<LD, LD> PDD;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 5;
void solve() {
  int a, b, c, d;
  cin >> c >> a >> b >> d;
  int maxv = (d >= c + 1 ? 1 : 0) + a + b + c + min(d, c);
  if (d) {
    if (a) --a;
    if (b) --b;
  }
  int minv = c + (d ? 1 : 0) + max(a, b);

  cout << minv << " " << maxv << "\n";
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);

  int _ = 1;
  cin >> _;
  while (_--) solve();
}