PROGRAMMING:Beat Dior
Dior, the villain's savior, is resurrected again. The invincible chengtaro starts to call up the double messengers and form a team to defeat the evil Dior. Now there are n (1 < = n < = 2e5) double messengers. Their ability is Q [i] (1 < = I < = n) (1 < = Q [i] < = 1e9). In order to defeat Dior, chengtaro needs to choose a team whose absolute value is no more than 5, so as to better cooperate, Led by the invincible platinum star, the team won. Can you help Cheng select the team with the most manpower（ Learn that the difference between the ability values of any two people in the team is no more than 5)
###Input format:
T group of test samples, each test sample has n in the first line and N in the next line.
###Output format:
For the maximum number of teams output for each test sample, each answer occupies one line.
###Input example:
Here is a set of inputs. For example:
```in
three
six
1 2 3 4 5 6
seven
2 2 2 2 2 2 2
five
1 10 20 30 40
```
###Output example:
The corresponding output is given here. For example:
```out
six
seven
one
```
answer：If there is no answer, please comment
###Input format:
T group of test samples, each test sample has n in the first line and N in the next line.
###Output format:
For the maximum number of teams output for each test sample, each answer occupies one line.
###Input example:
Here is a set of inputs. For example:
```in
three
six
1 2 3 4 5 6
seven
2 2 2 2 2 2 2
five
1 10 20 30 40
```
###Output example:
The corresponding output is given here. For example:
```out
six
seven
one
```
answer：If there is no answer, please comment