| 问题描述 |
|---|
JG is playing a card game. Each card has a number between 1 and M(including 1 and M). A straight is a sequence of cards with consecutive values. Values do not wrap around, so 1 does not come after M. In addition to regular cards,also contains jokers. Each joker can be used as any valid number (between 1 and M, including 1 and M). You will be given N integers card[1] .. card[n] referring to the cards in your hand. Jokers are represented by zeros, and other cards are represented by their values. JG wants to know the number of cards in the longest straight that can be formed using one or more cards from his hand. |
| 输入描述 |
The first line contains an integer T, meaning the number of the cases. For each test case: The first line there are two integers N and M in the first line (1 <= N, M <= 100000), and the second line contains N integers card[i] (0 <= card[i] <= M). |
| 输出描述 |
For each test case, output a single integer in a line -- the longest straight jg can get. |
| 样例输入复制样例 |
2
7 11
0 6 5 3 0 10 11
8 1000
100 100 100 101 100 99 97 103 |
| 样例输出 |
5 3 |
| 相关 |