Card Game

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

Description

Soda and Beta are good friends. They are going to play a card game today. Soda has $n$ cards with number $a_1, a_2, ..., a_n$ while Beta has $n$ cards with number $b_1, b_2, ..., b_n$.

First, they choose a number $m$ no larger than $n$. Then they both randomly select $m$ cards from their own $n$ cards. The one with larger sum of the selected cards will win. Soda wants to know if he can always win no mater what cards will be randomly selected from him and Beta.

Input

There are multiple test cases. The first line of input contains an integer $T (1 \le T \le 100)$, indicating the number of test cases. For each test case:

The first line contains two integer $n$ and $m$ $(1 \le m \le n \le 500)$. The second line contains $n$ integers $a_1, a_2, ..., a_n$ $(1 \le a_i \le 1000)$ denoting Soda's cards. The third line contains $n$ integers $b_1, b_2, ..., b_n$ $(1 \le b_i \le 1000)$ denoting Beta's cards.

Output

For each test case, output "YES" (without the quotes) if Soda can always win, otherwise output "NO" (without the quotes) in a single line.

Sample Input

2 3 1 4 5 6 1 2 3 5 2 3 4 7 8 9 3 4 5 2 3

Sample Output

YES NO

Hint

hujie

Source

BestCoder Round #58 (div.2)

提交代码