## 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-

### Vaccine Distribution Codechef December Long challenge solution 2020

Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

### Codechef February long challenge solution 2021

Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- https://www.codechef.com/FEB21/?itm_medium=navmenu&itm_campaign=FEB21 I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

### Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1