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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.*;
 
public class RedAndBlue {
	private static final FastReader fs = new FastReader();
	private static final PrintWriter out = new PrintWriter(System.out);
 
	private static void solve() {
		int n = fs.nextInt();
		long sum = 0,sumMaxRed = 0,sumMaxBlue = 0;
		TreeSet<Long> st = new TreeSet<>(Collections.reverseOrder());
		for(int i = 0; i<n; i++) {
			st.add(sum);
			sum += fs.nextLong();
			st.add(sum);
		}
		sumMaxRed = Math.max(sumMaxRed, st.first());
		st.clear();
		sum = 0;
		int m = fs.nextInt();
		for(int i = 0; i<m; i++) {
			st.add(sum);
			sum += fs.nextLong();
			st.add(sum);
		}
		sumMaxBlue = Math.max(sumMaxBlue, st.first());
		out.println(sumMaxRed+sumMaxBlue);
	}
 
	public static void main(String[] args) {
		Thread t = new Thread(null, null, "", 1 << 28) {
			public void run() {
				int test_case = 1;
				test_case = fs.nextInt();
				for (int cs = 1; cs <= test_case; cs++) {
					solve();
				}
				out.close();
			}
		};
		t.start();
		try {
			t.join();
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
	}
 
	private static class FastReader {
		BufferedReader br;
		StringTokenizer st;
 
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String next() {
			while (st == null || !st.hasMoreElements()) {
				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());
		}
 
		double nextDouble() {
			return Double.parseDouble(next());
		}
 
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
 
		int[] readintarray(int n) {
			int res[] = new int[n];
			for (int i = 0; i < n; i++)
				res[i] = nextInt();
			return res;
		}
 
		long[] readlongarray(int n) {
			long res[] = new long[n];
			for (int i = 0; i < n; i++)
				res[i] = nextLong();
			return res;
		}
	}
 
	public static class pair<T1 extends Comparable<T1>, T2 extends Comparable<T2>> implements Comparable<pair<T1, T2>> {
		T1 ff;
		T2 ss;
 
		public pair(T1 ff, T2 ss) {
			this.ff = ff;
			this.ss = ss;
		}
 
		public int compareTo(pair<T1, T2> o) {
			if (ff == o.ff)
				return ss.compareTo(o.ss);
			return ff.compareTo(o.ff);
		}
	}
 
	private static class cf {
		public static long power(long base, long exponent) {
			long res = 1;
			while (exponent > 0) {
				if (exponent % 2 == 1)
					res *= base;
				exponent >>= 1;
				base *= base;
			}
			return res;
		}
 
		public static long mul(long a, long b, long mod) {
			return (a % mod * b % mod) % mod;
		}
 
		public static long add(long a, long b, long mod) {
			return (a % mod + b % mod) % mod;
		}
 
		public static long sub(long a, long b, long mod) {
			return ((a % mod - b % mod) % mod + mod) % mod;
		}
 
		public static long power(long base, long exponent, long mod) {
			long res = 1;
			base %= mod;
			while (exponent > 0) {
				if (exponent % 2 == 1)
					res = mul(res, base, mod);
				exponent >>= 1;
				base = mul(base, base, mod);
			}
			return res;
		}
 
		public static void sortIntArray(int[] a) {
			ArrayList<Integer> tmp = new ArrayList<>();
			for (int x : a)
				tmp.add(x);
			Collections.sort(tmp);
			for (int i = 0; i < tmp.size(); i++)
				a[i] = tmp.get(i);
		}
 
		public static void sortLongArray(long[] a) {
			ArrayList<Long> tmp = new ArrayList<>();
			for (long x : a)
				tmp.add(x);
			Collections.sort(tmp);
			for (int i = 0; i < tmp.size(); i++)
				a[i] = tmp.get(i);
		}
 
		public static <T extends Comparable<T>> void sort(T[] a) {
			ArrayList<T> tmp = new ArrayList<>();
			for (T x : a)
				tmp.add(x);
			Collections.sort(tmp);
			for (int i = 0; i < tmp.size(); i++)
				a[i] = tmp.get(i);
		}
 
		public static int __gcd(int a, int b) {
			return b == 0 ? a : __gcd(b, a % b);
		}
 
		public static long __gcd(long a, long b) {
			return b == 0 ? a : __gcd(b, a % b);
		}
 
		public static int max(int[] a) {
			int mx = a[0];
			for (int ele : a) {
				mx = Math.max(mx, ele);
			}
			return mx;
		}
 
		public static long max(long[] a) {
			long mx = a[0];
			for (long ele : a) {
				mx = Math.max(mx, ele);
			}
			return mx;
		}
 
		public static int min(int[] a) {
			int mn = a[0];
			for (int ele : a) {
				mn = Math.min(mn, ele);
			}
			return mn;
		}
 
		public static long min(long[] a) {
			long mn = a[0];
			for (long ele : a) {
				mn = Math.min(mn, ele);
			}
			return mn;
		}
	}
}