#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fer(i,a,b) for(int i=a;i<=b;i++)
#define fdr(i,a,b) for(int i=a;i<=b;i++)
#define endl '\n'

int n,k;

void solve(){
	cin>>n>>k;
	int f=0;
	if(n%k==0){
		int tmp=n/k;
		if(n%2==0){
			int n1=n/2;
			if(n1%tmp==0) f=1;
		}
		else{
			int n1=n/2,n2=n/2+1;
			if(n1%tmp==0||n2%tmp==0) f=1;
		}
	}
	else{
		int cnt1=n%k,num1=n/k+1;
		int cnt2=k-n%k,num2=n/k;
		int num=n/2;
		int tnum=num;
		int tmp2=tnum/num2;
		tnum-=num2*min(tmp2,cnt2);
		int tmp1=tnum/num1;
		tnum-=num1*min(tmp1,cnt1);
		if(tnum==0) f=1;
		if(tnum<=cnt1-tmp1){
			f=1;
		}
	}
	if(f) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}

signed main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		solve();
	} 
}