#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto&& e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S>
bool chmin(T& a, const S& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
bool chmax(T& a, const S& b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;


struct mf_graph{
  struct _edge{
    int to,rev;
    ll cap;
  };
  struct edge{
    int from,to;
    ll cap,flow;
  };
  vector<array<int,2>> pos;
  vector<vector<_edge>> graph;
  unsigned v_size;
  mf_graph (int n):
    graph(n),v_size(n){}
  void add_edge(int from,int to,ll cap){
    pos.push_back({from,(int)graph[from].size()});
    graph[from].push_back(_edge({to,(int)graph[to].size(),cap}));
    graph[to].push_back(_edge({from,(int)graph[from].size()-1,0}));
  }
  ll flow(int s,int t){
    ll ret=0;
    vector lev(v_size,-1);
    auto bfs = [&](int s){
      fill(lev.begin(),lev.end(),-1);
      queue<int>q;
      lev[s]=0;
      q.push(s);
      while(!q.empty()){
        int v=q.front();
        q.pop();
        for(auto e:graph[v]){
          if(e.cap>0&&lev[e.to]<0){
            lev[e.to]=lev[v]+1;
            q.push(e.to);
          }
        }
      }
    };
    vector iter(v_size,0);
    auto dfs = [&](auto self,int v,ll f){
      if(v==t)return f;
      for(int &i=iter[v];i<graph[v].size();i++){
        _edge &e=graph[v][i];
        if(e.cap>0&&lev[v]<lev[e.to]){
          ll d=self(self,e.to,min(f,e.cap));
          if(d>0){
            e.cap-=d;
            graph[e.to][e.rev].cap+=d;
            return d;
          }
        }
      }
      return 0ll;
    };
    while(1){
      bfs(s);
      if(lev[t]<0)return ret;
      fill(iter.begin(),iter.end(),0);
      ll f=0;
      while((f=dfs(dfs,s,LLONG_MAX))>0){
        ret+=f;
      }
    }
  }
  vector<edge> edges(){
    vector<edge>ret;
    for(auto i:pos){
      auto e=graph[i[0]][i[1]],re=graph[e.to][e.rev];
      ret.push_back(edge({i[0],e.to,e.cap+re.cap,re.cap}));
    }
    return ret;
  }
};

void solve();

int main(){
  int T;
  cin>>T;
  while(T--)solve(); 
}

void solve(){
  array<ll,3> A,B;
  rep(i,3)cin>>A[i];
  rep(i,3)cin>>B[i];
  
  {
    ll S=A[0]+A[1]+A[2];
    mf_graph G(8);
    int sink=6,source=7;
    rep(i,3)G.add_edge(source,i,A[i]);
    rep(i,3)G.add_edge(i+3,sink,B[i]);
    G.add_edge(0,3,INFL);
    G.add_edge(0,5,INFL);
    G.add_edge(1,4,INFL);
    G.add_edge(1,3,INFL);
    G.add_edge(2,5,INFL);
    G.add_edge(2,4,INFL);
    cout<<S-G.flow(source,sink)<<' ';
  }
  {
    mf_graph G(8);
    int sink=6,source=7;
    rep(i,3)G.add_edge(source,i,A[i]);
    rep(i,3)G.add_edge(i+3,sink,B[i]);
    G.add_edge(0,4,INFL);
    G.add_edge(1,5,INFL);
    G.add_edge(2,3,INFL);
    cout<<G.flow(source,sink)<<'\n';
  }
}