#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long MD = 1000000007;
long double binpow(long double a, long long n) {
  if (n == 0) return 1;
  if (n % 2 == 1)
    return (binpow(a, n - 1) * a);
  else {
    long double b = (binpow(a, n / 2));
    return (b * b);
  }
}
const long long INF = 1e18;
long long loop = 1;
long long solve[1000];
long long res;
long long n, m, d, t;
long long dp[30][30];
long long c[1000005];
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    cin >> n >> m;
    if (n >= m)
      cout << "Yes" << endl;
    else {
      if (n >= 4)
        cout << "Yes" << endl;
      else {
        if (n == 2 && (m == 3 || m == 2 || m == 1)) {
          cout << "Yes" << endl;
        } else
          cout << "No" << endl;
      }
    }
  }
}
