HDU 5494 Card Game Sort

Card Game Time limit:2000/1000 MS (java/others) Memory limit:65536/65536 K (java/others)
Total submission (s): 94 Accepted Submission (s): 79


Problem Description Soda and Beta are good friends. They is going to play a card game today. Soda have n cards with number A1,A2,..., a while Beta have n cards with number B1,b2,..., bn.

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 would win. Soda wants to know if he can all win no mater what cards would be is randomly selected from him and Beta.
Input There is multiple test cases. The first line of input contains an integer T (1≤t≤100), indicating the number of test cases. For each test case:

The first line contains both integer n and M (1≤m≤n≤500). The second line contains n integers a1,a2,..., an (1≤