#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const double eps = 1e-8;
const long long inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1.0);
std::mt19937 rnd(233);
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
long long tt;
namespace FastIO {
bool IOerror = 0;
inline char nc() {
  static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
  if (p1 == pend) {
    p1 = buf;
    pend = buf + fread(buf, 1, 100000, stdin);
    if (pend == p1) {
      IOerror = 1;
      return -1;
    }
  }
  return *p1++;
}
inline bool blank(char ch) {
  return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T>
inline bool read(T& x) {
  bool sign = 0;
  char ch = nc();
  x = 0;
  for (; blank(ch); ch = nc())
    ;
  if (IOerror) return false;
  if (ch == '-') sign = 1, ch = nc();
  for (; ch >= '0' && ch <= '9'; ch = nc()) x = x * 10 + ch - '0';
  if (sign) x = -x;
  return true;
}
template <class T, class... U>
bool read(T& h, U&... t) {
  return read(h) && read(t...);
}
};  // namespace FastIO
inline long long rd() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
void out(long long a) {
  if (a < 0) putchar('-'), a = -a;
  if (a >= 10) out(a / 10);
  putchar(a % 10 + '0');
}
long long ksm(long long a, long long b, long long m) {
  long long ret = 1ll;
  while (b) {
    if (b & 1) ret *= a, ret %= m;
    a *= a, a %= m, b >>= 1;
  }
  return ret;
}
long long ksm(long long a, long long b) {
  long long ret = 1ll;
  while (b) {
    if (b & 1) ret *= a;
    a *= a, b >>= 1;
  }
  return ret;
}
long long inv(long long x, long long m) { return ksm(x, m - 2, m); }
const long long N = 1010;
long long a[N], b[N];
void run() {
  long long n = rd(), x = rd();
  for (long long i = 1; i <= n; i++) a[i] = rd();
  for (long long i = 1; i <= n; i++) b[i] = rd();
  sort(a + 1, a + n + 1);
  sort(b + 1, b + n + 1, greater<long long>());
  bool flg = true;
  for (long long i = 1; i <= n; i++)
    if (a[i] + b[i] > x) flg = false;
  puts(flg ? "Yes" : "No");
}
signed main() {
  for (tt = rd(); tt--;) run();
  return 0;
}
