#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265359;
const int MAX = 1e6 + 2;
const long long int inf = 1e18;
const int N = 1010;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const long long int mod = 1000000007;
inline long long int add(long long int a, long long int b) {
  a += b;
  if (a >= mod) a -= mod;
  return a;
}
inline long long int mul(long long int a, long long int b) {
  return (((a + mod) % mod) * (b + mod) % mod) % mod;
}
inline long long int power(long long int a, long long int b) {
  long long int rt = 1;
  while (b > 0) {
    if (b & 1) rt = mul(rt, a);
    a = mul(a, a);
    b >>= 1;
  }
  return rt;
}
inline long long int modInverse(long long int n, long long int p) {
  return power(n, p - 2) % p;
}
void stArt() {}
void eNd() {}
long long int i, j, k, l, m, r, n;
long long int a[MAX], b[MAX];
int main() {
  stArt();
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int T;
  cin >> T;
  while (T--) {
    cin >> n >> k;
    for (i = 0; i < n; i++) cin >> a[i];
    for (i = 0; i < n; i++) cin >> b[i];
    sort(a, a + n);
    sort(b, b + n, greater<long long int>());
    bool ok = 1;
    for (i = 0; i < n; i++)
      if (a[i] + b[i] > k) ok = 0;
    cout << (ok ? "Yes\n" : "No\n");
  }
  eNd();
  return 0;
}
