#include<bits/stdc++.h>
#define int long long int
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=1e6+5;
const int inf=1e18;
int tt=1;
int exgcd(int a,int b,int &x,int &y)
{
    if(b==0){
        x=1,y=0;return a;
    }
    int d=exgcd(b,a%b,x,y);
    int z=x;x=y;y=z-y*(a/b);
    return d;
}
int n,k;
void solve()
{
    cin>>n>>k;
    int a=(n/k+1),b=n/k,x0,y0;
    int d=exgcd(a,b,x0,y0);
    int r=(n+1)/2;
    if(n%k==0) {
        if((n+1)/2%(n/k)==0)
        {
        cout << "Yes" << '\n';
        return;
        }
        else
        {
            cout<<"No"<<'\n';
            return;
        }
    }

    if(r%d)
    {
        cout<<"No"<<'\n';return ;
    }
    x0*=(n+1)/2/d;
    y0*=(n+1)/2/d;
    x0%=(n/k);
    int minn=((n+1)/2 -(n/k)*(k-n%k))/(n/k+1);
    while(x0<=0)
    {
        x0+=n/k;
    }
    x0+=minn/(n/k) *(n/k);
    while(x0<minn)
    {
        x0+=n/k;
    }
    while(x0>=minn)
    {
        x0-=n/k;
    }
    x0+=n/k;
    if(x0<=n%k)
    {
        cout<<"Yes"<<'\n';
    }
    else
    {
        cout<<"No"<<'\n';
    }

}
signed main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cout<<fixed<<setprecision(10);
    cin>>tt;
    for(int i=1;i<=tt;i++)
    solve();
}