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 java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

public class B {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintStream out = System.out;

        int t = Integer.parseInt(br.readLine());

        for (int i = 0; i < t; i++) {
            combos = new HashMap<>();
            int n = Integer.parseInt(br.readLine());
            String[] temp = br.readLine().split(" ");
            int[] rn = new int[n];
            for (int x = 0; x < n; x++) rn[x] = Integer.parseInt(temp[x]);
            int m = Integer.parseInt(br.readLine());
            temp = br.readLine().split(" ");
            int[] rm = new int[m];
            for (int x = 0; x < m; x++) rm[x] = Integer.parseInt(temp[x]);

            out.println(dp(rn, rm, 0, 0));
        }

        System.out.flush();
    }
    static HashMap<Integer, Integer> combos;
    private static int dp(int[] rn, int[] rm, int n, int m) {
        if (n >= rn.length && m >= rm.length) return 0;
        int key = 1000*n + m;
        if (combos.containsKey(key)) return combos.get(key);
        int best = 0;
        if (n == rn.length) best = rm[m]+dp(rn,rm,n,m+1);
        else if (m == rm.length) best = rn[n]+dp(rn,rm,n+1,m);
        else best = Math.max(rm[m]+dp(rn,rm,n,m+1), rn[n]+dp(rn,rm,n+1,m));
        best = Math.max(best, 0);

        combos.put(key, best);
        return best;
    }
}
