#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
int inf = 1e9+7;
void solve(){
    int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f;
    int mx = min(a, e) + min(b, f) + min(c, d);
    mf_graph<int> g(8);
    g.add_edge(0, 1, a);
    g.add_edge(0, 2, b);
    g.add_edge(0, 3, c);
    g.add_edge(1, 4, inf);
    g.add_edge(1, 6, inf);
    g.add_edge(2, 5, inf);
    g.add_edge(2, 4, inf);
    g.add_edge(3, 6, inf);
    g.add_edge(3, 5, inf);
    g.add_edge(4, 7, d);
    g.add_edge(5, 7, e);
    g.add_edge(6, 7, f);
    int h = g.flow(0, 7);
    cout << a+b+c-h << " " << mx << endl;
}

int main(){

    int t; cin >> t;
    while(t--)solve();
    return 0;
}