Codeforces Round 905 (Div. 3) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

binary search

greedy

two pointers

*1400

No tag edit access

The problem statement has recently been changed. View the changes.

×
G1. Dances (Easy version)

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThis is the easy version of the problem. The only difference is that in this version $$$m = 1$$$.

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:

- Choose any element from array $$$a$$$ and remove it (all remaining elements are shifted to a new array $$$a$$$),
- Choose any element from array $$$b$$$ and remove it (all remaining elements are shifted to a new array $$$b$$$).

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 \leq i \leq 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 \leq i \leq m$$$. Array $$$c[i]$$$ is obtained from $$$a$$$ as follows:

- $$$c[i]_1 = i$$$,
- $$$c[i]_j = a_j$$$, for $$$2 \leq j \leq n$$$.

Input

Each test consists of multiple test cases. The first line contains a single integer $$$t$$$ ($$$1 \leq t \leq 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 \leq n \leq 10^5$$$, $$$m = 1$$$) - 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 \leq a_i \leq 10^9$$$).

The third line of each test case contains $$$n$$$ integers $$$b_1, b_2, \ldots, b_n$$$ ($$$1 \leq b_i \leq 10^9$$$).

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

Output

For each test case, output the total number of minimum operations for all pairs of arrays $$$(c_i, b)$$$.

Example

Input

42 113 24 15 1 53 8 3 38 14 3 3 2 2 1 11 1 1 1 3 3 3 39 19 2 8 3 7 4 6 51 2 3 2 1 4 5 6 5

Output

0 1 4 4

Note

In the first test case for the pair of arrays $$$([1, 1], [3, 2])$$$, the answer is $$$0$$$. No operations or reordering of elements are needed.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/02/2023 05:30:39 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|