#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

ll exgcd(ll a, ll b, ll& x, ll& y){
    if(!b) {
        x = 1;
        y = 0;
        return a;
    }
    ll d = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t;
    std::cin >> t;
    // int T = t;
    // int tot = 0;
    while(t--){
        int n, k;
        std::cin >> n >> k;
        ll x = 0, y = 0;
        ll a = n / k, b = (n + k - 1) / k;
        ll c = n / 2;

        // ++tot;
        // if(T > 100 && tot == 125) std::cout << "---> " << n << ' ' << k << endl;
        // if(T > 100) continue;
        
        if(a == b){
            std::cout << (c % a == 0 ? "Yes" : "No") << endl;
            continue;
        }

        // if((c - (a + 1) * (n % k) + a - 1) / a <= k - n % k) std::cout << "Yes\n";
        // else std::cout << "No\n";

        ll l = (c - (a + 1) * (n % k) + a - 1) / a;
        // std::cerr << l << endl;
        ll d = exgcd(a, b, x, y);
        x = (x * c % b + b) % b;
        // std::cerr << x << endl;
        ll m = (l - x + b - 1) / b;
        x = x + b * m;
        // y = (c - x * a) / b;
        // std::cerr << x << ' ' << y << endl;
        if(x <= std::min(c / a, ((ll)k - n % k))) std::cout << "Yes\n";
        else std::cout << "No\n";
    }
    
    return 0;
}