def solve():
    N = int(input())
    A = list(map(int, input().split()))
    acc = [A[0]]
    mn = [A[0]]
    mx = [A[0]]
    for i in range(1, N):
        acc.append(acc[-1] + A[i])
        mn.append(min(mn[-1], acc[i]))
        mx.append(max(mx[-1], acc[i]))
    ans = 0
    for i in range(2, N):
        ans = max(
            ans,
            abs(acc[-1] - acc[i - 1])
            + max(
                abs(acc[i - 1] - mx[i - 2]) + abs(mx[i - 2]),
                abs(acc[i - 1] - mn[i - 2]) + abs(mn[i - 2]),
            ),
        )
    print(ans)


for _ in range(int(input())):
    solve()