#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<iostream>
#include<algorithm>
#define M 505
using namespace std;
int A[M],B[M];
bool cmp(int a,int b){
    return a>b;
}
bool cmp1(int a,int b){
    return a<b;
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        int n,m;
        scanf("%d%d",&n,&m);
        int j;
        for(j=0;j<n;j++) scanf("%d",&A[j]);
        for(j=0;j<n;j++) scanf("%d",&B[j]);
        sort(A,A+n,cmp1);sort(B,B+n,cmp);
        int a=0,b=0;
        for(j=0;j<m;j++){
            a+=A[j];b+=B[j];
        }
        if(a>b) printf("YES\n");
        else printf("NO\n");
    }
    //system("pause");
    return 0;
}