#define _CRT_SECURE_NO_WARNINGS
#include<queue>
#include<cmath>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
const int N=2e5+10;

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

inline bool sol(ll a,ll b,ll m,ll R1,ll R2) //cal ax+by=m (0<=x<=R1)(0<=y<=R2)
{
    ll x,y;
    ll d=exgcd(a,b,x,y);
    if(m%d)return 0;
    a/=d;
    b/=d;
    m/=d;
    ll xx=(ll)x*(m%b)%b;
    if(xx<0)  xx=xx+b;
    ll yy=(ll)(m-a*xx)/b;
    if(yy<0||xx>R1)
        return 0;
    else
    {
        if(0<=xx&&xx<=R1&&0<=yy&&yy<=R2)return 1;
        else
        {
            ll l1=-xx*a,r1=(R1-xx)*a;
            ll l2=-(R2-yy)*b,r2=yy*b;
            ll l=max(l1,l2),r=min(r1,r2);
            ll ab=a*b;
            if(l>r)return 0;
            else if(r/ab>0&&r/ab*ab>=l)return 1;
            else return 0;
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);   cin.tie(nullptr),cout.tie(nullptr);
    int t;
    cin>>t;
    while(t--)
    {
        ll n,k;
        cin>>n>>k;
        ll a=n/k+1,b=n/k,m=(n+1)/2,x,y;
        puts(sol(a,b,m,n%k,n-(n%k))?"YES":"NO");
    }
    return 0;
}