#include <bits/stdc++.h>

using namespace std;
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define ii pair<ll, ll>
#define vll vector<long long int>
using ll = long long int;
#define pb push_back
#define ss second
#define ff first
#define fl(i, n) for (ll i = 0; i < n; i++)
#define fl1(i, n) for (ll i = 1; i < n; i++)
#define flc(a, b) for (ll i = a; i <= b; i++)
#define flr(a, b) for (ll i = a; i >= b; i--)
#define nl "\n"
#define br cout << "\n";
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
// #define mod 998244353
#define inf 1e15

void print(vector<ll> &v)
{
    for (auto x : v)
        cout << x << " ";
    cout << endl;
}

template<typename T>
istream& operator>>(istream& in, vector<T>& v) {
    for (auto& elem : v) {
        in >> elem;
    }
    return in;
}

ll binExponentiation(ll a, ll b,ll mod)
{
    a %= mod;
    ll result = 1;
    while (b)
    {
        if (b & 1)
            result = (result * 1ll * a) % mod;
        a = (a * 1ll * a) % mod;
        b >>= 1;
    }
    return result;
}

void solve(){

    vi a(3), b(3); cin>>a >>b;
    ll mn = 0, mx = 0 ,n =3; 

   
    fl(i,n) {
        mx += min(a[i],b[(i+1)%n]);
        mn += max(0ll,a[i] - b[i] - b[(i+2)%n]) ;
    }

    cout << mn << " " << mx<<nl;

}

int main() {
    // ios_base::sync_with_stdio(false);
    // cin.tie(nullptr);

    ll t=1;
    cin >> t;
    for (ll i = 0; i < t; i++) {
        solve();
    }
    
    return 0;
}