Identical Scarves

아직 제출이 없습니다시간 제한1초메모리 제한256 MB

문제

Maggy makes some extra money by knitting scarves. Today she got lucky -- a merchant made an offer for as many scarves as possible, under one condition, though -- he wants only scarves of the same length, counted in the number of rows (otherwise they look bad in the store). He announced that he would return shortly, after exactly kk moments. Maggy knows the current lengths of all scarves and both stitching and unravelling a row takes her one moment. Help Maggy -- compute how many scarves of equal length she can produce.

입력

The first line of the input contains two integers nn and kk (1n105 1 \leq n \leq 10^5, 0k1090 \leq k \leq 10^9), separated by a single space, denoting the number of scarves and the number of moments after which the merchant will return. In the second and last line of the input there are nn natural numbers a_ia\_i (1a_i1091 \leq a\_i \leq 10^9), each separated by a single space. These are the lengths of consecutive scarves, counted in the number of rows.

출력

You should write one integer number in the first and only line of the output -- the maximum number of scarves of equal length that Maggy can produce before the merchant returns.

힌트

In 66 moments Maggy can make the lengths of all scarves equal to 22.