#include <bits/stdc++.h>
using namespace std;
bool prime[100000];
int64_t gcd(int64_t a, int64_t b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void SieveOfEratosthenes() {
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= 100000; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= 100000; i += p) prime[i] = false;
    }
  }
}
long long binpow(long long a, long long b) {
  a %= 1000000007;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
    b >>= 1;
  }
  return res % 1000000007;
}
int64_t invmd(int64_t n) { return (binpow(n, 1000000007 - 2)); }
int solve() {
  int x, y;
  cin >> x >> y;
  if (x == 1 && y > 1) {
    cout << "NO" << endl;
    return 0;
  }
  if (x == y || (x > 1 && x > y)) {
    cout << "YES" << endl;
    return 0;
  }
  if (x == 2 && y > 3) {
    cout << "NO" << endl;
    return 0;
  }
  if (x == 2 && y == 3) {
    cout << "YES" << endl;
    return 0;
  }
  if (x % 2 == 0 && x > 2) {
    cout << "YES" << endl;
    return 0;
  }
  if (x % 2 == 1 && x != 3) {
    cout << "YES" << endl;
    return 0;
  }
  if (x % 2 == 1 && x == 3) {
    cout << "NO" << endl;
    return 0;
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
