CF1914D.Three Activities

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:

• go skiing;
• watch a movie in a cinema;
• play board games.

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.

寒假即将到来，假期将持续 $n$ 天。

在此期间，Monocarp 想要和朋友们恰好各体验一次以下三项活动：

• 去滑雪；
• 去电影院看电影；
• 玩桌游。

Monocarp 已知：在第 $i$ 天，恰好有 $a_i$ 位朋友陪他去滑雪，$b_i$ 位朋友陪他去看电影，$c_i$ 位朋友陪他玩桌游。

Monocarp 还知道，他每天最多只能进行一项活动。

因此，他请你帮他选出三个互不相同的日期 $x, y, z$，使得参与这三项活动的朋友总人数（即 $a_x + b_y + c_z$）最大化。

The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of testcases.

The first line of each testcase contains a single integer $n$ ($3 \le n \le 10^5$) — the duration of the winter holidays in days.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 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, \dots, b_n$ ($1 \le b_i \le 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, \dots, c_n$ ($1 \le c_i \le 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$.

第一行包含一个整数 $t$（$1 \le t \le 10^4$）——测试用例的数量。

每个测试用例的第一行包含一个整数 $n$（$3 \le n \le 10^5$）——寒假的持续天数。

第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10^8$）——第 $i$ 天将与 Monocarp 一起滑雪的朋友人数。

第三行包含 $n$ 个整数 $b_1, b_2, \dots, b_n$（$1 \le b_i \le 10^8$）——第 $i$ 天将与 Monocarp 一起看电影的朋友人数。

第四行包含 $n$ 个整数 $c_1, c_2, \dots, c_n$（$1 \le c_i \le 10^8$）——第 $i$ 天将与 Monocarp 一起玩桌游的朋友人数。

所有测试用例的 $n$ 值之和不超过 $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.

对于每个测试用例，输出一个整数——即最多能与 Monocarp 一起参加这三天不同活动的朋友总数。

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, Monocarp can choose day $1$ for skiing, day $4$ for a movie and day $2$ for board games. $30 + 20 + 25 = 75$ friends in total. Note that Monocarp can't choose day $1$ for all activities, because he can't try more than one activity in a single day.

In the third testcase, Monocarp can choose day $2$ for skiing, day $3$ for a movie and day $7$ for board games. $19 + 19 + 17 = 55$ friends in total.

In the fourth testcase, Monocarp can choose day $1$ for skiing, day $4$ for a movie and day $9$ for board games. $17 + 19 + 20 = 56$ friends in total.

在第一个测试用例中，Monocarp 可以选择第 $2$ 天滑雪、第 $1$ 天看电影、第 $3$ 天玩桌游。这样，将有 $a_2 = 10$ 位朋友和他一起滑雪，$b_1 = 10$ 位朋友和他一起看电影，$c_3 = 10$ 位朋友和他一起玩桌游。朋友总数为 $30$。

在第二个测试用例中，Monocarp 可以选择第 $1$ 天滑雪、第 $4$ 天看电影、第 $2$ 天玩桌游，总计 $30 + 20 + 25 = 75$ 位朋友。注意：Monocarp 不能在同一天安排多项活动，因此他不能将所有活动都安排在第 $1$ 天。

在第三个测试用例中，Monocarp 可以选择第 $2$ 天滑雪、第 $3$ 天看电影、第 $7$ 天玩桌游，总计 $19 + 19 + 17 = 55$ 位朋友。

在第四个测试用例中，Monocarp 可以选择第 $1$ 天滑雪、第 $4$ 天看电影、第 $9$ 天玩桌游，总计 $17 + 19 + 20 = 56$ 位朋友。