#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
const long long INF = 1e18;
const long long mod = 1e9 + 7;
using namespace std;
int main() {
  long long T;
  cin >> T;
  while (T--) {
    long long l, r;
    cin >> l >> r;
    if (2 * l > r) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
