#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int a[3], b[3];
    rep(i, 3) cin >> a[i];
    rep(i, 3) cin >> b[i];
    constexpr int INF = 1001001001;
    constexpr int s = 7, t = 8;
    {
      mcf_graph<int, int> g(t + 1);
      rep(i, 3) g.add_edge(s, i, a[i], 0);
      rep(i, 3) rep(j, 3) g.add_edge(i, 3 + j, INF, (i + 1) % 3 == j ? 1 : 0);
      rep(j, 3) g.add_edge(3 + j, t, b[j], 0);
      cout << g.flow(s, t).second << ' ';
    }
    {
      mcf_graph<int, int> g(t + 1);
      rep(i, 3) g.add_edge(s, i, a[i], 0);
      rep(i, 3) rep(j, 3) g.add_edge(i, 3 + j, INF, (i + 1) % 3 == j ? 0 : 1);
      rep(j, 3) g.add_edge(3 + j, t, b[j], 0);
      cout << a[0] + a[1] + a[2] - g.flow(s, t).second << '\n';
    }
  }
}