#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int solve(){
	vector<int> a(3);
	vector<int> b(3);
	cin >> a >> b;
	
	const int INF = 1001001001;
	
	int s = 0;
	rep(i, 3) s += a[i];
	
	auto solve_min = [&](vector<int> a, vector<int> b){
		int res = INF;
		
		auto judge = [&](){
			
			mf_graph<int> graph(8);
			
			rep(j, 3){
				graph.add_edge(j, j + 3, INF);
				graph.add_edge(j, (j + 2) % 3 + 3, INF);
			}
			
			int sv = 6;
			int tv = 7;
			
			rep(j, 3){
				graph.add_edge(sv, j, a[j]);
				graph.add_edge(j + 3, tv, b[j]);
			}
			
			return graph.flow(sv, tv);
		};
		
		return s - judge();
	};
	
	auto solve_max = [&](vector<int> a, vector<int> b){
		int res = 0;
		res += min(a[0], b[1]);
		res += min(a[1], b[2]);
		res += min(a[2], b[0]);
		return res;
	};
	cout << solve_min(a, b) << ' ' << solve_max(a, b) << "\n";
	
	return 0;
}

int main(){
	int t;
	cin >> t;
	rep(_, t) solve();
	return 0;
}