**Compilation/Execution Result:**

Given two arrays, the task is to complete the function **max_path_sum **that takes 4 argument The first two arguments represent the 2 arrays

Here We start from first element of B which is 1, then we move to 5, then 7. From 7, we switch to A (7 is common) and traverse 10 and 12.

**Thus The result will be 1+5+7+10+12 =35**

**Input:**

The first line of input contains an integer **T **denoting the no of test cases . Then T cases follow.

Each test case contains 3 lines. The first line contains two space separated integers **l1** and **l2** denoting the length of the two sorted array **A** and **B**. In the second line is the space separated values of array A and in the third line are space separated values of array B.

**Output:**

For each test case the output is the max sum obtained in such fashion .

**Constraints:**

1<=T<=100

1<=N,M<=100

1<=A[],B[]<=1000

**Example:**

2

5 4

2 3 7 10 12

1 5 7 8

3 3

1 2 4

1 2 7

**Output**

35

10

**Explanation**

**1.** For first test case the path will be 1+5+7+10+12 = 35

**2.** For second test case the path will be 1+2 +7=10

**Note:**The **Input/Ouput** format and **Example** given are used for system's internal purpose, and should be used by a user for **Expected Output** only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

Author: Shubham Joshi 1

surbhi_7 | 116 |

John Carey | 92 |

Rajat Thakur 2 | 85 |

shaktiman_shaktiman_shaktiman | 81 |

mystery | 80 |

Ibrahim Nash | 592 |

ashrepos | 490 |

RealHorror | 364 |

shaktiman_shaktiman_shaktiman | 353 |

shi143din | 340 |

akhayrutdinov | 4052 |

sanjay05 | 3406 |

Quandray | 2427 |

Michael Riegger | 2228 |

Jasleen Kaur 2 | 2012 |