B"Winter holidays are coming up. They are going to last for n days. During the holidays, Monocarp wants to try all of these activities exactly once with his friends: Monocarp knows that, on the i -th day, exactly a_i friends will join him for skiing, b_i friends will join him for a movie and c_i friends will join him for board games. Monocarp also knows that he can't try more than one activity in a single day. Thus, he asks you to help him choose three distinct days x, y, z in such a way that the total number of friends to join him for the activities ( a_x + b_y + c_z ) is maximized. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The first line of each testcase contains a single integer n ( 3 <= n <= 10^5 ) -- the duration of the winter holidays in days. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^8 ) -- the number of friends that will join Monocarp for skiing on the i -th day. The third line contains n integers b_1, b_2, ... , b_n ( 1 <= b_i <= 10^8 ) -- the number of friends that will join Monocarp for a movie on the i -th day. The fourth line contains n integers c_1, c_2, ... , c_n ( 1 <= c_i <= 10^8 ) -- the number of friends that will join Monocarp for board games on the i -th day. The sum of n over all testcases doesn't exceed 10^5 . For each testcase, print a single integer -- the maximum total number of friends that can join Monocarp for the activities on three distinct days. In the first testcase, Monocarp can choose day 2 for skiing, day 1 for a movie and day 3 for board games. This way, a_2 = 10 friends will join him for skiing, b_1 = 10 friends will join him for a movie and c_3 = 10 friends will join him for board games. The total number of friends is 30 . In the second testcase,"...