#include<iostream>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#define scnaf scanf
#define cahr char
#define bug puts("bugbugbug");
using namespace std;
typedef long long ll;
const int mod=1000000007;
const int maxn=500+5;
const int inf=1e9;
int T_T;
int a[maxn],b[maxn];
int main()
{
    scanf("%d",&T_T);
    while(T_T--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        for(int i=0;i<n;i++)
            scanf("%d",&b[i]);
        int aa=0,bb=0;
        sort(a,a+n);
        sort(b,b+n);
        for(int i=0;i<m;i++){
                aa+=a[i];
             bb+=b[n-1-i];
        }
        if(aa>bb) puts("YES");
        else puts("NO");
    }
    return 0;
}