Advantage
There are $$$n$$$ participants in a competition, participant $$$i$$$ having a strength of $$$s_i$$$. Every participant wonders how much of an advantage they have over the other best participant. In other words, each participant $$$i$$$ wants to know the difference between $$$s_i$$$ and $$$s_j$$$, where $$$j$$$ is the strongest participant in the competition, not counting $$$i$$$ (a difference can be negative).So, they ask you for your help! For each $$$i$$$ ($$$1 \leq i \leq n$$$) output the difference between $$$s_i$$$ and the maximum strength of any participant other than participant $$$i$$$.
For the first test case: The first participant has a strength of $$$4$$$ and the largest strength of a participant different from the first one is $$$7$$$, so the answer for the first participant is $$$4 - 7 = -3$$$.  The second participant has a strength of $$$7$$$ and the largest strength of a participant different from the second one is $$$5$$$, so the answer for the second participant is $$$7 - 5 = 2$$$. The third participant has a strength of $$$3$$$ and the largest strength of a participant different from the third one is $$$7$$$, so the answer for the third participant is $$$3 - 7 = -4$$$. The fourth participant has a strength of $$$5$$$ and the largest strength of a participant different from the fourth one is $$$7$$$, so the answer for the fourth participant is $$$5 - 7 = -2$$$. 
The input consists of multiple test cases. The first line contains an integer $$$t$$$ ($$$1 \leq t \leq 1000$$$) — the number of test cases. The descriptions of the test cases follow.The first line of each test case contains an integer $$$n$$$ ($$$2 \leq n \leq 2\cdot10^5$$$) — the length of the array.The following line contains $$$n$$$ space-separated positive integers $$$s_1$$$, $$$s_2$$$, ..., $$$s_n$$$ ($$$1 \leq s_i \leq 10^9$$$) — the strengths of the participants.It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2\cdot10^5$$$.
For each test case, output $$$n$$$ space-separated integers. For each $$$i$$$ ($$$1 \leq i \leq n$$$) output the difference between $$$s_i$$$ and the maximum strength of any other participant.
def f():
    s = int(input())
    a = [int(i) for i in input().split()]
    c = sorted(a)
    b = []
    l = c[-1]
    for i in range(s):
        r = a[i] - l
        if r == 0:
            r = a[i] - c[-2]
        b.append(str(r))
    print(' '.join(b))
t = int(input())
for i in range(t):
    f()
for _ in range(int(input())):
    a = int(input())
    b = list(map(int, input().split(' ')))
    m = max(b)
    s = sorted(b)
    second_max = s[-2] if len(s) > 1 else m
    n = [str(m - second_max) if x == m else str(x - m) for x in b]
    ans = ' '.join(n)
    print(ans)
for _ in range(int(input())):
    dontcare = input()
    inputList = input().split(' ')
    inputList = [int(a) for a in inputList]
    inputCopy = inputList.copy()
    inputCopy.pop(inputCopy.index((firstMax := max(inputList))))
    secondMax = max(inputCopy)
    output = [str(a - secondMax) if a == firstMax else str(a - firstMax) for a in inputList]
    print(' '.join(output))