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.util.*;


public class Main {
    static int i,j,k,n,m,t,x,y,max=1000000;
    static long ans,a,b,c,d,l,r,sum,mi,ma,mod=998244353 ;
    static String str;
    static char ch;
    static FastScanner fs = new FastScanner();


    public static void main(String[] args) {

        t = fs.nextInt();

        while(t-- >0) {

            n = fs.nextInt();
            ;

            long[] ans1 = new long[n+5];


            int[] arr1 = new int[n+5];


            long temp1=0;
            long temp2=0;

            for(i=0;i<n;i++){
                arr1[i]= fs.nextInt();
            }
            m = fs.nextInt();
            long[] ans2 = new long[m+5];
            int[] arr2 = new int[m+5];

            for(i=0;i<m;i++){
                arr2[i] = fs.nextInt();
            }

            ans1[0]=arr1[0];
            ans2[0]=arr2[0];

            temp1 = Math.max(temp1,ans1[0]);
            temp2 = Math.max(temp2,ans2[0]);

            for(i=1;i<n;i++){
                ans1[i]=ans1[i-1]+arr1[i];

                if(ans1[i]>temp1)
                    temp1 = ans1[i];
            }

            for(i=1;i<m;i++){
                ans2[i]=ans2[i-1]+arr2[i];

                if(ans2[i]>temp2)
                    temp2 = ans2[i];
            }


            System.out.println(temp1+temp2);




        }
    }


    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }

    private static long inv( long a, long b){
        return 1<a ? b - inv(b%a,a)*b/a : 1;
    }

    //To be used with priority queues.
    static class Pair implements Comparable<Pair> {
        long first, second;
        long len;
        public Pair(long first, long second) {
            this.first=first;
            this.second=second;
            this.len=second-first+1;
        }

        public int compareTo(Pair o) {
            if (len!=o.len) {
                return -Long.compare(len, o.len);
            }
            else {
                return Long.compare(first, o.first);
            }
        }

    }

    static void sort(int[] a) {
        ArrayList<Integer> l=new ArrayList<>();
        for (int i:a) l.add(i);
        Collections.sort(l);
        for (int i=0; i<a.length; i++) a[i]=l.get(i);
    }

}