#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#define inc(i,l,r) for(i=l;i<=r;i++)
#define dec(i,l,r) for(i=l;i>=r;i--)
#define inf 1e9
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define succ(x) (1<<x)
#define NM  1000
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int T,n,m,s,a[NM],b[NM],i;
int main(){
    T=read();
    while(T--){
        s=0;
        n=read();m=read();
        inc(i,1,n)a[i]=read();
        inc(i,1,n)b[i]=read();
        sort(a+1,a+1+n);
        sort(b+1,b+1+n);
        inc(i,1,m)
        s+=a[i]-b[n-i+1];
        if(s>0)printf("YES\n");else printf("NO\n");
    }
    return 0;
}