#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int mpow(int base, int exp);
void sieve();
vector<int> getFactors(long long x);
template <typename F, typename S>
ostream &operator<<(ostream &out, const pair<F, S> &p) {
  return out << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << "[";
  typename vector<T>::const_iterator it;
  for (it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) out << ", ";
    out << *it;
  }
  return out << "]";
}
template <typename T>
ostream &operator<<(ostream &out, const set<T> &v) {
  out << "[";
  typename set<T>::const_iterator it;
  for (it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) out << ", ";
    out << *it;
  }
  return out << "]";
}
template <typename T>
ostream &operator<<(ostream &out, const unordered_set<T> &v) {
  out << "[";
  typename unordered_set<T>::const_iterator it;
  for (it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) out << ", ";
    out << *it;
  }
  return out << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &out, const map<F, S> &v) {
  out << "[";
  typename map<F, S>::const_iterator it;
  for (it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) out << ", ";
    out << it->first << ":" << it->second;
  }
  return out << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &out, const unordered_map<F, S> &v) {
  out << "[";
  typename unordered_map<F, S>::const_iterator it;
  for (it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) out << ", ";
    out << it->first << ":" << it->second;
  }
  return out << "]";
}
long long randGen(long long lower, long long upper) {
  return (rand() % (upper - lower + 1)) + lower;
}
long long dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int MAX = 1e6 + 5;
bool prime[MAX];
int spf[MAX];
void test_case() {
  int n, x;
  cin >> n >> x;
  vector<int> a(n), b(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) cin >> b[i];
  sort(a.begin(), a.end());
  sort(b.begin(), b.end(), greater<int>());
  for (int i = 0; i < n; i++) {
    if ((a[i] + b[i]) > x) {
      cout << "NO\n";
      return;
    }
  }
  cout << "YES\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  cin >> t;
  while (t-- > 0) {
    test_case();
  }
  return 0;
}
int mpow(int base, int exp) {
  base %= MOD;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long)result * base) % MOD;
    base = ((long long)base * base) % MOD;
    exp >>= 1;
  }
  return result;
}
void sieve() {
  fill(prime, prime + MAX, true);
  for (int i = 1; i < MAX; i++) spf[i] = i;
  prime[0] = prime[1] = false;
  for (int i = 2; i * i < MAX; i++) {
    if (prime[i]) {
      for (int j = i * i; j < MAX; j += i) {
        if (prime[j]) spf[j] = i;
        prime[j] = false;
      }
    }
  }
}
vector<int> getFactors(long long int x) {
  vector<int> ret;
  while (x != 1) {
    ret.push_back(spf[x]);
    x = x / spf[x];
  }
  return ret;
}
