## Problem Statement-

Monocarp had a sequence $a$ consisting of $n+m$ integers ${a}_{1},{a}_{2},\dots ,{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},\dots ,{r}_{n}$ and ${b}_{1},{b}_{2},\dots ,{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\left(a\right)=max\left(0,{a}_{1},\left({a}_{1}+{a}_{2}\right),\left({a}_{1}+{a}_{2}+{a}_{3}\right),\dots ,\left({a}_{1}+{a}_{2}+{a}_{3}+\cdots +{a}_{n+m}\right)\right)$

Help Monocarp to calculate the maximum possible value of $f\left(a\right)$.

Input

The first line contains one integer $t$ ($1\le t\le 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\le n\le 100$).

The second line contains $n$ integers ${r}_{1},{r}_{2},\dots ,{r}_{n}$ ($-100\le {r}_{i}\le 100$).

The third line contains one integer $m$ ($1\le m\le 100$).

The fourth line contains $m$ integers ${b}_{1},{b}_{2},\dots ,{b}_{m}$ ($-100\le {b}_{i}\le 100$).

Output

For each test case, print one integer — the maximum possible value of $f\left(a\right)$.

Example
input
Copy
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
Copy
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 $\left[\mathbf{6},2,\mathbf{-}\mathbf{5},3,\mathbf{7},\mathbf{-}\mathbf{3},-4\right]$.

In the second test case, one of the possible sequences $a$ is $\left[10,\mathbf{1},-3,\mathbf{1},2,2\right]$.

In the third test case, one of the possible sequences $a$ is $\left[\mathbf{-}\mathbf{1},-1,-2,-3,\mathbf{-}\mathbf{2},-4,-5,\mathbf{-}\mathbf{3},\mathbf{-}\mathbf{4},\mathbf{-}\mathbf{5}\right]$.

In the fourth test case, one of the possible sequences $a$ is $\left[0,\mathbf{0}\right]$.

Solution-

### codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

### Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

### Movie Festival CSES problem set solution

Movie Festival CSES problem set solution - Problem statement-  Time limit:  1.00 s   Memory limit:  512 MB In a movie festival  n n  movies will be shown. You know the starting and ending time of each movie. What is the maximum number of movies you can watch entirely? Input The first input line has an integer  n n : the number of movies. After this, there are  n n  lines that describe the movies. Each line has two integers  a a  and  b b : the starting and ending times of a movie. Output Print one integer: the maximum number of movies. Constraints 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ a < b ≤ 10 9 1 ≤ a < b ≤ 10 9 Example Input: 3 3 5 4 9 5 8 Output: 2 Solution - Step -1 take input in a vector as a pair first element is ending time ans second element is starting time Step -2 sort the vector in increasing order because we will watch that movie which is ending first. Step -3 iterate over vector and calculate ans .           follow code below-