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

public class Prb2 {

    static PrintWriter pw;
    static Scanner sc;
    static long mod = 1000000000+7;

    static void print(final String arg) {
      pw.write(arg);
      pw.flush();      
    }     

    static void runFile() throws Exception {

      sc = new Scanner(new FileReader("input.txt"));
      pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
    }

    static void runIo() throws Exception  {

      pw =new PrintWriter(System.out);
      sc = new Scanner(System.in);
    }    

    static boolean sv[] = new boolean[1000002];

    static void seive() {
        //true -> not prime
        // false->prime

        sv[0] = sv[1] = true; 
        sv[2] = false;
        for(int i = 0; i< sv.length; i++) {
            if( !sv[i] && (long)i*(long)i < sv.length ) {
                for ( int j = i*i; j<sv.length ; j += i ) {                
                    sv[j] = true;
                }
            }
        }

    }
    
    static class Pair {
        int a ,b;
        Pair(int a, int b){
            this.a = a;
            this.b = b;
        }
    }

    static int count = 0, ans = 0, map[][];

     public static void main(String[] args)  throws Exception {


        // runFile();

        runIo();   
 
        int t =  sc.nextInt();

        while( t-- > 0 ) {   
        
           
            int n = sc.nextInt();
            int r[] = new int[n];

            for(int i = 0; i<n; i++)
                r[i] = sc.nextInt();

            int m = sc.nextInt();
            int b[] = new int[m];
            for(int i = 0; i<m; i++)
                b[i] = sc.nextInt();            

            map= new int[n+1][m+1];

            for(int i = 0; i<=n; i++)
                Arrays.fill(map[i], -1);

            count = 0;

            find(r, b, n-1, m-1 );


            print(count+"\n");
 
        } 
        
    }

    static int find(int r[], int b[], int i, int j){

        if( i == -1 && j == -1)
            return 0;




        if( i == -1){
            int temp =  b[j] + find(r, b, i, j-1);
            count = Math.max(count, temp);
            return temp;
        }

        if( j == -1){
            int temp =   r[i] + find(r, b, i-1, j);
            count = Math.max(count, temp);
            return temp ;
        }


        if( map[i][j] != -1 ){

            count = Math.max(count, map[i][j]);

            return map[i][j];
        }

         int temp = Math.max(r[i]+find(r, b, i-1, j), b[j] + find(r, b, i, j-1));

         count = Math.max(count, temp);
         return map[i][j] = temp ;

    }
              
}
 

