#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

//const unsigned long long maxN=(unsigned long long)1<<65-1;
unsigned long long n,k,T;
//bool win[maxN];
//bool solve();

int main()
{
    freopen("tstones.in","r",stdin);
    freopen("tstones.out","w",stdout);

    scanf("%lld",&T);
    //win[0]=0;
    while(T--)
    {
        scanf("%lld %lld",&n,&k);
        if(n%(k+1)) printf("NO\n");
        else printf("YES\n");
    }
    //scanf("%d",&k);n=100;solve();
    //for(int i=1;i<=n;i++) cout<<win[i]<<' ';

    return 0;
}

/* 打表代码
bool solve()
{
    for(int i=1;i<=n;i++)
    {
        win[i]=0;
        for(int j=1;j<=k;j++) win[i]|=j<=i && !win[i-j];
    }
    if(win[n]) return 0;
    else return 1;
}
*/