tiger2005 has $$$n$$$ sticks, numbered from $$$1$$$ to $$$n$$$. The $$$i$$$-th stick has a positive integer length $$$a_i$$$.
ITcarrot wants tiger2005 to select $$$k$$$ sticks, and these $$$k$$$ sticks can form a simple polygon.
ITcarrot wonders tiger2005 can find at least one way to do that.
Noted that a simple polygon is a closed geometric shape with straight sides that encloses a non-zero area.
The first line contains two positive integers $$$n, k$$$($$$3\le k\le n \le 3000$$$), denoting the number of sticks and the number of sticks which tiger2005 needs to select respectively.
The second line contains $$$n$$$ integers $$$a_1, a_2, \cdots, a_n(\forall i \in [1,n], 1\le a_i\le 10^9)$$$. The $$$i$$$-th of which is the length of the $$$i$$$-th stick.
Output Yes if tiger2005 can find a way to form a simple polygon, otherwise please output No.
3 31 2 3
No
6 41 1 4 5 1 4
Yes