PROGRAMMING:Drill, break through the sky!
Simon went through a dimensional universe, where his own spiral force could not be used. The spiral God told him that you need to collect enough drill crystals to get the spiral force to break through the sky and leave the dimensional universe. Simon went to a cave through all kinds of hardships, In this cave, n (1 < = n < = 1E5) drill crystals are arranged in a linear manner. There is a number a (1 < = a < = 1E5) on each drill crystal. On the stone tablet beside it is written the rules for obtaining drill crystal. Simon can choose an interval of 1 < = l < = R < = n, If there are more than s (1 < = s < = 1E5) bit crystals with the same number in this interval, the bit crystals with this number will be broken at the moment when Simon takes them out, and Simon cannot absorb the broken bit crystals. Do you know how many drill crystals Simon can get at most?
###Exemplar explanation
```c++
For 1, 2, 12, we choose the interval [2,5], Simon can absorb four drill crystals
```
###Input example:
There are t groups of examples to ensure that the sum of all n is not greater than 1e6. Input n and s respectively in the next line, and input the number on each drill crystal in the next line
```in
one
5 2
1 1 2 1 2
```
###Output example:
```out
four
```
answer：If there is no answer, please comment
###Exemplar explanation
```c++
For 1, 2, 12, we choose the interval [2,5], Simon can absorb four drill crystals
```
###Input example:
There are t groups of examples to ensure that the sum of all n is not greater than 1e6. Input n and s respectively in the next line, and input the number on each drill crystal in the next line
```in
one
5 2
1 1 2 1 2
```
###Output example:
```out
four
```
answer：If there is no answer, please comment