import sys
input = sys.stdin.readline

T=int(input())
for tests in range(T):
    A=list(map(int,input().split()))
    B=list(map(int,input().split()))

    MAX=min(A[0],B[1])+min(A[1],B[2])+min(A[2],B[0])

    # dinic法

    from collections import defaultdict,deque

    V=8
    EDGE=[defaultdict(int) for i in range(V)]

    start=6
    goal=7

    for i in range(3):
        u,v,c=start,i,A[i]
        EDGE[u][v]=c

        u,v,c=i+3,goal,B[i]
        EDGE[u][v]=c

    u,v,c=0,3,1<<60
    EDGE[u][v]=c

    u,v,c=0,5,1<<60
    EDGE[u][v]=c

    u,v,c=1,4,1<<60
    EDGE[u][v]=c

    u,v,c=1,3,1<<60
    EDGE[u][v]=c

    u,v,c=2,5,1<<60
    EDGE[u][v]=c

    u,v,c=2,4,1<<60
    EDGE[u][v]=c

    ANS=0
    while True:
        # まずBFSする

        DIS=[-1]*V
        Q=deque([start])
        DIS[start]=0
        EDGE2=[[] for i in range(V)]

        while Q:
            x=Q.popleft()
            for to in EDGE[x]:
                if EDGE[x][to]==0:
                    continue
                
                if DIS[to]==-1:
                    DIS[to]=DIS[x]+1
                    Q.append(to)
                    EDGE2[x].append(to)
                    
                elif DIS[to]==DIS[x]+1:
                    EDGE2[x].append(to)

        if DIS[goal]==-1:
            break

        # BFSしたときのEDGEを使ってDFSする

        MINCOST=[float("inf")]*V
        NOW=start
        ROUTE=[-1]*V
        
        while NOW!=-1: # DFS

            cost=MINCOST[NOW]
            
            if NOW==goal:
                ANS+=cost
                i=goal
                
                while i!=start: # goalからたどり,Routeを使ってEDGEの更新
                    j=ROUTE[i]
                    if EDGE[j][i]==cost:
                        NOW=j
                        EDGE2[j].pop()
                    
                    EDGE[j][i]-=cost # 使ったルートをいけなく更新
                    MINCOST[j]-=cost                
                    EDGE[i][j]+=cost # 逆向きに進めるようにする.
                    i=j
                continue

            if EDGE2[NOW]:
                to=EDGE2[NOW][-1]
                ROUTE[to]=NOW
                MINCOST[to]=min(cost,EDGE[NOW][to])
                NOW=to

            else:
                if NOW==start:
                    break
                EDGE2[ROUTE[NOW]].pop()
                NOW=ROUTE[NOW]

    #print(ANS)
                

    MIN=sum(A)-ANS

    print(MIN,MAX)