B'This is the hard version of the problem. The only difference is that in this version m <= q 10^9 . You are given two arrays of integers a_1, a_2, ldots, a_n and b_1, b_2, ldots, b_n . Before applying any operations, you can reorder the elements of each array as you wish. Then, in one operation, you will perform both of the following actions, if the arrays are not empty: Let k be the final size of both arrays. You need to find the minimum number of operations required to satisfy a_i < b_i for all 1 <= q i <= q k . This problem was too easy, so the problem author decided to make it more challenging. You are also given a positive integer m . Now, you need to find the sum of answers to the problem for m pairs of arrays (c[i], b) , where 1 <= q i <= q m . Array c[i] is obtained from a as follows: Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= q t <= q 10^4 ) - the number of sets of input data. This is followed by their description. The first line of each test case contains two integers n and m ( 2 <= q n <= q 10^5 , 1 <= q m <= q 10^9 ) - the size of arrays a and b and the constraints on the value of element a_1 . The second line of each test case contains n - 1 integers a_2, ldots, a_n ( 1 <= q a_i <= q 10^9 ). The third line of each test case contains n integers b_1, b_2, ldots, b_n ( 1 <= q b_i <= q 10^9 ). It is guaranteed that the sum of n over all test cases does not exceed 10^5 . For each test case, output the total number of minimum operations for all pairs of arrays (c_i, b) . In the first test case: '...