#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1000000+10;
unsigned long long n[maxn] ,k[maxn];
int tk;
bool book;
int main()
{
	freopen("tstones.in", "r", stdin);
	freopen("tstones.out", "w", stdout); 
	int i, j;
	cin>>tk;
	for(i=1; i<=tk; i++)
	{
		scanf("%d%d", &n[i], &k[i]);
	}
	for(i=1; i<=tk; i++)
	{
		if(n[i]%(k[i]+1)==0) book=1;
		if(book) cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
	return 0;
}