Rar the cast has finally defeated the evil king of the stringed numbers!!! (Thanks to you of course)

However, there is a new problem. Since all the strings are broken, Rar doesn't have any string to play with anymore!

There is a solution though. The broken bits of string can be joined back under special, mathematical, insanely ordered conditions. If the numbers on two bits of string are the same, they can merge to form a longer string! And as we all know (I think), Rar the cat loooves long strings. The longer the string, the better. But wait! The string can't be too long either, because if it is, it might form another super string and try to take over NOI!!!

Help Rar find the greatest frequency of numbers that is less than a certain value!

## Input

The first line of input containes two integers, N and M.

These denotes the length of the string of numbers and the greatest frequency you can output.

This is followed by N integers, the ith integer being the ith number on Rar's string.

## Output

A single number, the greatest frequency of the number on the string that is less than M

Clarification: The frequency should be less than M, not the number of the greatest frequency. You are to output the frequency, not the number of the greatest frequency.

## Limits

0 <= N <= 1000
Every number on the string is smaller than 1000

## Sample Input 1

5 4
1 1 1 4 5

## Sample Output 1

3

## Sample Input 2

20 5
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2

## Sample Output 2

1