import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
t = int(input())
#a = list(map(int,input().split()))
#a = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    a.append(list(map(int,input().split())))
def calc(a,b):
    ans = 0
    for i in range(3):
        ans += min(a[i],b[(i+1)%3])
    return ans

def calc2(a,b):
    ans = []
    for i in range(3):
        x = b[i] + b[i-1]
        if a[i] >= x:
            ans.append(a[i] - x)
    return ans[0] if ans else 0

def solve():
    a = list(map(int,input().split()))
    b = list(map(int,input().split()))
    print(calc2(a[:],b[:]),calc(a[:],b[:]))


for i in range(t):
    solve()