#include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define ll long long
const int mod = 1e9 + 7;
const int N = 1e5 + 50;
using namespace std;

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

void slove(){
	ll n, k;
	cin>>n>>k;
	ll len = n/k;
	ll len2 = n/k+1;
	ll t2 = n%k;
	ll t1 = n-n%k;
	ll a = len, b = len2;
	ll x, y;
	ll c = (n+1)/2;
	ll d = exgcd(a, b, x, y);
	if (c%d != 0) {
		cout<<"No"<<'\n'; 
	} else {
		a /= d, b /= d, c /= d;
		x *= c, y *= c;
		x = (x%b+b)%b;
		// ax <= c
		// a(x+b*k) <= c
		ll k = (c/a-x)/b;
		
		// x+b*k <= t1
		ll k2 = (t1-x)/b;
		x = min(k, k2) * b + x;
		if (x < 0) cout<<"No"<<'\n';
		else {
			y = (c-a*x)/b;
			if (0 <= y && y <= t2) {
				cout<<"Yes"<<'\n';
			} else {
				cout<<"No"<<'\n';
			}
		}
	}	
}
signed main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int T = 1;
	cin >> T;
	while(T--){
		slove();
	}
	return 0;
}