Kasat

t = int(input())
while t > 0:
    a, b, c, n = (int(x) for x in input().split())
    D = sorted([a,b,c])

    d = min(D[1]-D[0], D[2]-D[1], n)
    D = [D[0]+d, D[1], D[2]-d]
    n = n - d

    if n > 0:
        while D[1]-D[0] > 0 and n > 1:
            D = [D[0]+2, D[1]-1, D[2]-1]
            n = n - 2
        while D[2]-D[1] > 0 and n > 1:
            D = [D[0]+1, D[1]+1, D[2]-2]
            n = n - 2
        D.sort()
        while n > 0:
            D = sorted([D[0]+1, D[1], D[2]-1])
            n = n - 1
    #    if n % 2:
    #        D = sorted([D[0]+1, D[1], D[2]-1])

    print(" ".join(str(x) for x in D))
    t = t - 1

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED