CF1941F.Rudolf and Imbalance

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

The first line of each test case contains three integers $n$ , $m$ , and $k$ ( $2 \le n \le 10^5$ , $1 \le m, k \le 2 \cdot 10^5$ ) — the number of prepared problems, the number of models, and the number of functions, respectively.

The second line of each test case contains $n$ integers $a_1, a_2, a_3, \dots a_n$ ( $1 \le a_i \le 2 \cdot 10^9$ , $a_i < a_{i+1}$ ) — the complexities of the prepared problems.

The third line of each test case contains $m$ integers $d_1, d_2, d_3, \dots d_m$ ( $1 \le d_i \le 10^9$ ) — the complexities of the models.

The fourth line of each test case contains $k$ integers $f_1, f_2, f_3, \dots f_k$ ( $1 \le f_i \le 10^9$ ) — the complexities of the functions.

It is guaranteed that the sum of $n$ over all testcases does not exceed $10^5$ .

It is guaranteed that the sum of $m$ over all testcases does not exceed $2 \cdot 10^5$ .

It is guaranteed that the sum of $k$ over all testcases does not exceed $2 \cdot 10^5$ .

For each testcase, output a single number — the minimum imbalance that Rudolf can achieve.

无