Three Activities
Winter holidays are coming up. They are going to last for $$$n$$$ days.During the holidays, Monocarp wants to try all of these activities exactly once with his friends:   go skiing;  watch a movie in a cinema;  play board games. Monocarp knows that, on the $$$i$$$-th day, exactly $$$a_i$$$ friends will join him for skiing, $$$b_i$$$ friends will join him for a movie and $$$c_i$$$ friends will join him for board games.Monocarp also knows that he can't try more than one activity in a single day.Thus, he asks you to help him choose three distinct days $$$x, y, z$$$ in such a way that the total number of friends to join him for the activities ($$$a_x + b_y + c_z$$$) is maximized.
In the first testcase, Monocarp can choose day $$$2$$$ for skiing, day $$$1$$$ for a movie and day $$$3$$$ for board games. This way, $$$a_2 = 10$$$ friends will join him for skiing, $$$b_1 = 10$$$ friends will join him for a movie and $$$c_3 = 10$$$ friends will join him for board games. The total number of friends is $$$30$$$.In the second testcase, Monocarp can choose day $$$1$$$ for skiing, day $$$4$$$ for a movie and day $$$2$$$ for board games. $$$30 + 20 + 25 = 75$$$ friends in total. Note that Monocarp can't choose day $$$1$$$ for all activities, because he can't try more than one activity in a single day.In the third testcase, Monocarp can choose day $$$2$$$ for skiing, day $$$3$$$ for a movie and day $$$7$$$ for board games. $$$19 + 19 + 17 = 55$$$ friends in total.In the fourth testcase, Monocarp can choose day $$$1$$$ for skiing, day $$$4$$$ for a movie and day $$$9$$$ for board games. $$$17 + 19 + 20 = 56$$$ friends in total.
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of testcases.The first line of each testcase contains a single integer $$$n$$$ ($$$3 \le n \le 10^5$$$) — the duration of the winter holidays in days.The second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 10^8$$$) — the number of friends that will join Monocarp for skiing on the $$$i$$$-th day.The third line contains $$$n$$$ integers $$$b_1, b_2, \dots, b_n$$$ ($$$1 \le b_i \le 10^8$$$) — the number of friends that will join Monocarp for a movie on the $$$i$$$-th day.The fourth line contains $$$n$$$ integers $$$c_1, c_2, \dots, c_n$$$ ($$$1 \le c_i \le 10^8$$$) — the number of friends that will join Monocarp for board games on the $$$i$$$-th day.The sum of $$$n$$$ over all testcases doesn't exceed $$$10^5$$$.
For each testcase, print a single integer — the maximum total number of friends that can join Monocarp for the activities on three distinct days.
def func(a1, b1, c1) -> int:
    (a, b, c) = (a1[:], b1[:], c1[:])
    fm = max(a)
    index = a.index(fm)
    a.pop(index)
    b.pop(index)
    c.pop(index)
    sm = max(b)
    index = b.index(sm)
    a.pop(index)
    b.pop(index)
    c.pop(index)
    tm = max(c)
    return fm + sm + tm
for t in range(int(input())):
    n = int(input())
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    c = list(map(int, input().split()))
    m1 = func(a, b, c)
    m2 = func(b, a, c)
    m3 = func(c, b, a)
    m4 = func(a, c, b)
    m5 = func(b, c, a)
    m6 = func(c, a, b)
    print(max(m1, m2, m3, m4, m5, m6))
""""""

def func(a1, b1, c1) -> int:
    (a, b, c) = (a1[:], b1[:], c1[:])
    fm = max(a)
    index = a.index(fm)
    a.pop(index)
    b.pop(index)
    c.pop(index)
    sm = max(b)
    index = b.index(sm)
    a.pop(index)
    b.pop(index)
    c.pop(index)
    tm = max(c)
    return fm + sm + tm
for t in range(int(input())):
    n = int(input())
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    c = list(map(int, input().split()))
    m1 = func(a, b, c)
    m2 = func(b, a, c)
    m3 = func(c, b, a)
    m4 = func(a, c, b)
    m5 = func(b, c, a)
    m6 = func(c, a, b)
    print(max(m1, m2, m3, m4, m5, m6))
def maxf(a, b, c, la, lb, lc):
    global ans
    used = [la[0]]
    count = a[la[0]]
    if lb[0] not in used:
        count += b[lb[0]]
        used.append(lb[0])
    else:
        count += b[lb[1]]
        used.append(lb[1])
    if lc[0] not in used:
        count += c[lc[0]]
    elif lc[1] not in used:
        count += c[lc[1]]
    else:
        count += c[lc[2]]
    ans = max(count, ans)
t = int(input())
for _ in range(t):
    n = int(input())
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    c = list(map(int, input().split()))
    la = sorted(range(n), key=lambda x: a[x], reverse=True)
    lb = sorted(range(n), key=lambda x: b[x], reverse=True)
    lc = sorted(range(n), key=lambda x: c[x], reverse=True)
    ans = 0
    maxf(a, b, c, la, lb, lc)
    maxf(a, c, b, la, lc, lb)
    maxf(b, a, c, lb, la, lc)
    maxf(b, c, a, lb, lc, la)
    maxf(c, a, b, lc, la, lb)
    maxf(c, b, a, lc, lb, la)
    print(ans)