Monocarp had a sequence a consisting of n + m integers a_1, a_2, ..., a_{n + m}. He painted the elements into two colors, red and blue; n elements were painted red, all other m elements were painted blue.

After painting the elements, he has written two sequences r_1, r_2, ..., r_n and b_1, b_2, ..., b_m. The sequence r consisted of all red elements of a in the order they appeared in a; similarly, the sequence b consisted of all blue elements of a in the order they appeared in a as well.

Unfortunately, the original sequence was lost, and Monocarp only has the sequences r and b. He wants to restore the original sequence. In case there are multiple ways to restore it, he wants to choose a way to restore that maximizes the value of 

$$$f(a) = max(0, a_1, (a_1 + a_2), (a_1 + a_2 + a_3), ..., (a_1 + a_2 + a_3 + ... + a_{n + m}))$$$

Help Monocarp to calculate the maximum possible value of f(a).

Input

The first line contains one integer t (1 ≤ t ≤ 1000) — the number of test cases. Then the test cases follow. Each test case consists of four lines.

The first line of each test case contains one integer n (1 ≤ n ≤ 100).

The second line contains n integers r_1, r_2, ..., r_n (-100 ≤ r_i ≤ 100).

The third line contains one integer m (1 ≤ m ≤ 100).

The fourth line contains m integers b_1, b_2, ..., b_m (-100 ≤ b_i ≤ 100).

Output

For each test case, print one integer — the maximum possible value of f(a).

Example

Input


4
4
6 -5 7 -3
3
2 3 -4
2
1 1
4
10 -3 2 2
5
-1 -2 -3 -4 -5
5
-1 -2 -3 -4 -5
1
0
1
0


Output


13
13
0
0

Note

In the explanations for the sample test cases, red elements are marked as bold.

In the first test case, one of the possible sequences a is [6, 2, -5, 3, 7, -3, -4].

In the second test case, one of the possible sequences a is [10, 1, -3, 1, 2, 2].

In the third test case, one of the possible sequences a is [-1, -1, -2, -3, -2, -4, -5, -3, -4, -5].

In the fourth test case, one of the possible sequences a is [0, 0].
#import os
import sys
#from io import BytesIO, IOBase
#import itertools
import math
#import operator as op
#from functools import cmp_to_key
#import threading
from heapq import heappop, heappush, heapify
#import random
#import bisect
#from queue import PriorityQueue, Queue 
#from collections import defaultdict, deque
#from collections import deque
#import random
# result = ((a > b) and [x] or [y])[0]
# result = (lambda:y, lambda:x)[a > b]()
intl   = lambda: list(map(int, inp().split(" ")))
iinp   = lambda: int(sys.stdin.readline())
inp    = lambda: sys.stdin.readline().strip()
strl   = lambda: list(inp().strip().split(" "))
mint   = lambda: map(int, inp().split())
finp   = lambda: list(map(float, inp().split(" ")))
flush  = lambda: sys.stdout.flush()
ran    = lambda x: range(len(x))
enum   = lambda x,y=0: enumerate(x,y)
mati   = lambda n, fun=0: [[fun if type(fun) is int else fun(i,j) for j in range(n)] for i in range(n)]
vec    = lambda n, fun=0: [fun if type(fun) is int else fun(i) for i in range(n)]
vecst  = lambda n, fun=0: [fun if type(fun) is int else fun() for i in range(n)]
vecadv = lambda n, fun=0, s=0, st=1: [fun if type(fun) is int else fun(i) for i in range(s,n,st)]
matinp = lambda n: [intl() for i in range(n)]

for _ in range(iinp()):
    
    n = iinp()
    a = intl()
    m = iinp()
    b = intl()
    sx=0
    ansx=0
    for i in a:
        sx+=i
        ansx=max(ansx,sx)
    sy=0
    ansy=0
    for i in b:
        sy+=i
        ansy=max(ansy,sy)

    print(ansx+ansy)

        


