CF1468D.Firecrackers

Consider a long corridor which can be divided into $n$ square cells of size $1 \times 1$ . These cells are numbered from $1$ to $n$ from left to right.

There are two people in this corridor, a hooligan and a security guard. Initially, the hooligan is in the $a$ -th cell, the guard is in the $b$ -th cell ( $a \ne b$ ).

One of the possible situations. The corridor consists of $7$ cells, the hooligan is in the $3$ -rd cell, the guard is in the $6$ -th ( $n = 7$ , $a = 3$ , $b = 6$ ).There are $m$ firecrackers in the hooligan's pocket, the $i$ -th firecracker explodes in $s_i$ seconds after being lit.

The following events happen each second (sequentially, exactly in the following order):

1. firstly, the hooligan either moves into an adjacent cell (from the cell $i$ , he can move to the cell $(i + 1)$ or to the cell $(i - 1)$ , and he cannot leave the corridor) or stays in the cell he is currently. If the hooligan doesn't move, he can light one of his firecrackers and drop it. The hooligan can't move into the cell where the guard is;
2. secondly, some firecrackers that were already dropped may explode. Formally, if the firecracker $j$ is dropped on the $T$ -th second, then it will explode on the $(T + s_j)$ -th second (for example, if a firecracker with $s_j = 2$ is dropped on the $4$ -th second, it explodes on the $6$ -th second);
3. finally, the guard moves one cell closer to the hooligan. If the guard moves to the cell where the hooligan is, the hooligan is caught.

Obviously, the hooligan will be caught sooner or later, since the corridor is finite. His goal is to see the maximum number of firecrackers explode before he is caught; that is, he will act in order to maximize the number of firecrackers that explodes before he is caught.

Your task is to calculate the number of such firecrackers, if the hooligan acts optimally.

The first line contains one integer $t$ ( $1 \le t \le 1000$ ) — the number of test cases.

Each test case consists of two lines. The first line contains four integers $n$ , $m$ , $a$ and $b$ ( $2 \le n \le 10^9$ ; $1 \le m \le 2 \cdot 10^5$ ; $1 \le a, b \le n$ ; $a \ne b$ ) — the size of the corridor, the number of firecrackers, the initial location of the hooligan and the initial location of the guard, respectively.

The second line contains $m$ integers $s_1$ , $s_2$ , ..., $s_m$ ( $1 \le s_i \le 10^9$ ), where $s_i$ is the time it takes the $i$ -th firecracker to explode after it is lit.

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

For each test case, print one integer — the maximum number of firecrackers that the hooligan can explode before he is caught.

In the first test case, the hooligan should act, for example, as follows:

• second 1: drop the second firecracker, so it will explode on the $5$ -th second. The guard moves to the cell $5$ ;
• second 2: move to the cell $2$ . The guard moves to the cell $4$ ;
• second 3: drop the first firecracker, so it will explode on the $4$ -th second. The guard moves to the cell $3$ ;
• second 4: move to the cell $1$ . The first firecracker explodes. The guard moves to the cell $2$ ;
• second 5: stay in the cell $1$ . The second firecracker explodes. The guard moves to the cell $1$ and catches the hooligan.