#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <iostream>

#define mp make_pair
#define pb push_back
#define xx first
#define yy second

using namespace std;

int a[1005], b[1005];

main() {
  int T, i, n, m, p, s;

  scanf("%d",&T);
  while(T--){
    scanf("%d%d",&n,&m);
    for (i = 0; i < n; i++)
      scanf("%d",&a[i]);
    for (i = 0; i < n; i++)
      scanf("%d",&b[i]);
    sort(a, a + n);
    sort(b, b + n);

    s = p = 0;
    for (i = 0; i < m; i++)
      s += a[i];
    for (i = n - m; i < n; i++)
      p += b[i];
    if (s > p) printf("YES\n");
    else printf("NO\n");
  }
  return 0;
}