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.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
import java.util.StringTokenizer;


public class Edu101 {
	static PrintWriter out;
	static Scanner sc;
	static ArrayList<Integer>primes;
	static HashSet<Integer>primesH;
	static boolean prime[];
	//static ArrayList<Integer>a;
	static HashSet<Long>h;
	static boolean[]v;
	static int[]a,b,c;
	static long[]l,dp;
	public static void main(String[]args) throws IOException {
		sc=new Scanner(System.in);
		out=new PrintWriter(System.out);
		//A();
		//sieveOfEratosthenes(1000000);
		B();
	//	C();
		//minimum for subarrays of fixed length
		//D();
		out.close();
	}
	  private static void A() throws IOException {
		 int t=sc.nextInt();
		 while(t-->0) {
			String s=sc.next();
			int cnt=0,sum=0;
		
			for(int i=0;i<s.length();i++) {
				if(sum<0)break;
				switch(s.charAt(i)) {
				case '(':sum++;break;
				case ')':sum--;break;
				case '?':if(sum==0)sum++;else sum--;break;
	
				}
			}
			out.println(sum==0?"YES":"NO");
		 }
		
	}
	  static void C() throws IOException {
			int t=sc.nextInt();
			while(t-->0) {
				int n=sc.nextInt();
				
				
			}		
		}
	static void B() throws IOException {
		int t=sc.nextInt();
		while(t-->0) {
			int n=sc.nextInt();
			a=sc.nextArrInt(n);
			int m=sc.nextInt();
			b=sc.nextArrInt(m);
			int mx1=0,mx2=0,s1=0,s2=0;
			for(int i=0;i<a.length;i++) {
				s1+=a[i];
				mx1=Math.max(mx1, s1);
			}
			for(int i=0;i<b.length;i++) {
				s2+=b[i];
				mx2=Math.max(mx2, s2);
			}
			out.println(mx1+mx2);
			
		}
	}

	
	static void D() throws IOException {
		int t=sc.nextInt();
		while(t-->0) {
			int n=sc.nextInt();
		
	}
}
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public boolean hasNext() {return st.hasMoreTokens();}
		public int nextInt() throws IOException {return Integer.parseInt(next());}
		
		public long nextLong() throws IOException {return Long.parseLong(next());}

		public String nextLine() throws IOException {return br.readLine();}
			
		public boolean ready() throws IOException {return br.ready(); }
		public int[] nextArrInt(int n) throws IOException {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
		public long[] nextArrLong(int n) throws IOException {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

	}
}