codechef16Feb

def f(x):
    if (len(x) <= 1):
        return 0
    sum = 0
    for i in range(0, len(x)-1):
        sum += abs(x[i+1] - x[i])
    return sum

for _ in range(int(input())):
    n = int(input())
    l = list(map(int, input().split()))

    b = max(l)
    s = min(l)

    arr = list()
    if l.index(b) == l.index(s):
        # to do
        print("case1")
    elif l.index(b) < l.index(s):
        arr.append(b)
        arr.append(s)
        min_ind = l.index(s)+1
        while min_ind <= len(l)-1:
            arr.append(max(l[min_ind:]))
            min_ind = l.index(arr[-1])+1

            if min_ind > len(l)-1:
                break

            arr.append(min(l[min_ind:]))
            min_ind = l.index(arr[-1])+1
    else:
        arr.append(s)
        arr.append(b)
        min_ind = l.index(b)+1
        while min_ind <= len(l)-1:
            arr.append(min(l[min_ind:]))
            min_ind = l.index(arr[-1])+1

            if min_ind > len(l)-1:
                break

            arr.append(max(l[min_ind:]))
            min_ind = l.index(arr[-1])+1

    for e in arr:
        l.remove(e)

    print(f(l) + f(arr))