eolymp
bolt
Try our new interface for solving problems
Problems

Elections

Elections

Time limit 1 second
Memory limit 128 MiB

Sema and Yura take part in the elections. But it seems to them too boring, and they interviewed all the voters for whom they had voted.

It is known that there are only n voters and k candidates. You need to determine whether the election will end in one round, that is, whether there is a candidate for whom there was given more than half of the votes.

Input data

First line contains two integers n and k (1n10^5, 1k100) - the numbers of voters and the number of candidates.

Second line contains n integers a[1], a[2], ..., a[n] (1a[i]k), where a[i] is the candidate's number, for whom the i-th voter gave his vote.

Output data

Print "YES", if the elections will run in one round, and "NO" otherwise.

Examples

Input example #1
7 4
2 4 1 2 2 3 2
Output example #1
YES
Input example #2
4 4
1 2 3 4
Output example #2
NO
Input example #3
8 3
3 1 2 1 3 3 1 3
Output example #3
NO
Source 2019 ACM SEERC, 1/8 Finals, April 13