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].
// package com.mohitvirmani;

import java.util.*;

public class Main {

    public static void main(String[] args) {
//        try {
//            Scanner scanner = new Scanner(System.in);
//            int testCases = scanner.nextInt();
//
//            for (int test = 0; test < testCases; test++) {
//
//                String s = scanner.next();
//
//
//                solve(s);
//
//            }
//        } catch (Exception e) {
//
//        }
        Scanner scanner = new Scanner(System.in);
        int testCases = scanner.nextInt();
        for (int i = 0; i < testCases; i++) {
            int n = scanner.nextInt();
            int[] arr = new int[n];
            int c=0, d = 0;
            int t1=0, t2 = 0;
            for (int j = 0; j < arr.length; j++) {
                arr[j] = scanner.nextInt();
                c =c + arr[j];
                t1 = Math.max(c, t1);
            }
            int m = scanner.nextInt();

            int[] arr2 = new int[m];
            for (int j = 0; j < arr2.length; j++) {
                arr2[j] = scanner.nextInt();
                d = d + arr2[j];
                t2 = Math.max(d, t2);
            }
            System.out.println(t1 + t2);


        }

    }

    private static void solve(String s) {
        try {
            int counter = 0;
            String exp = s.replace("?", "");
//            System.out.println(exp);
            String open = s.replace("(", "1");
            String close = s.replace(")", "2");
            int openb = open.length() - open.replaceAll("1", "").length();
            int closeb = close.length() - close.replaceAll("2", "").length();
            int ques = s.length() - openb - closeb;
            int toalLength = s.length();
            if (toalLength % 2 != 0) {
                System.out.println("NO");
            } else {
                if ((openb + closeb + ques == toalLength)) {
                    int score = 0;
                    for (int i = 0; i < s.length(); i++) {


                        if (s.charAt(i) == '(') {
                            score = score + 1;
                        } else if (s.charAt(i) == ')') {
                            score = score - 1;
                        } else {
                            break;
                        }


                    }
                    if (score >= 0) {
                        System.out.println("YES");
                    } else {
                        System.out.println("NO");
                    }

                } else {
                    System.out.println("NO");
                }
            }
        } catch (Exception e) {

        }
    }

    private static boolean checkBalancedParanthesis(String expr) {
        Deque<Character> stack
                = new ArrayDeque<Character>();


        for (int i = 0; i < expr.length(); i++) {
            char x = expr.charAt(i);

            if (x == '(' || x == '[' || x == '{') {

                stack.push(x);
                continue;
            }

            if (stack.isEmpty())
                return false;
            char check;
            switch (x) {
                case ')':
                    check = stack.pop();
                    if (check == '{' || check == '[')
                        return false;
                    break;

            }
        }

        return (stack.isEmpty());
    }

}