시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 64 MB 2 2 2 100.000%

문제

You have got $n$ sticks of lengths $d_1, d_2, \ldots, d_n$. To build a ladder, you need $k+2$ sticks: two sticks of length $x$ and $k$ sticks of length $y$. You may shorten the sticks you already have, but you cannot divide one stick into two. Can you make a ladder?

입력

The first line of the input contains a single integer $z$, the number of test cases. The descriptions of the test cases follow.

Each test case consists of four integers $n$, $k$, $x$, $y$ ($1 \leq n \leq 10^5$, $0 \leq k \leq 10^5$, $1 \leq x, y \leq 10^9$) followed by $n$ integers $d_1$, $d_2$, $\ldots$, $d_n$ ($1 \leq d_i \leq 10^9$).

출력

For each test case, output a single line containing a single word "YES" if making a ladder is possible, or "NO" otherwise.

예제 입력 1

2
8 3 5 2
1 1 1 2 3 4 5 6
8 3 6 2
1 1 1 2 3 4 5 6

예제 출력 1

YES
NO