def solve():
    a,b,c,K=map(int,input().split())
    for _ in range(K):
        a,b,c=(b+c)//2,(c+a)//2,(a+b)//2
        if a==b==c:
            return a+b+c
    return a+b+c

def greedy(A,B,C,K):
    print(0,A,B,C,A+B+C)
    for k in range(1,K+1):
        A,B,C=(B+C)//2,(C+A)//2,(A+B)//2
        print(k,A,B,C,A+B+C)
    return A,B,C

#==================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write

T=int(input())
write("\n".join(map(str,[solve() for _ in range(T)])))