#include<bits/stdc++.h>
#define fa(i,op,n) for(int i=op;i<=n;i++)
#define fb(i,op,n) for(int i=op;i>=n;i--)
#define endl '\n'
#define pb push_back
#define var auto
using namespace std;
using ll = long long;
using pii = pair<int, int>;

const int N = 1e6 + 10;
const double eps = 1e-5;
ll n, k;

bool solve() 
{
	cin >> n >> k;
	if (n == 1 && k == 1) return true;
	if (k == 1) return false;
	if (k % 2 == 0) return true;
	if (n < k * 2) return true;
	if (n % k == 0) return false;
	// if(1){
		// ll r = n%k;
		// if(r == 0) return 0;
		// ll x1 = (k+1)/2*1ll*(n/k);
		// ll x2 = k/2*1ll*(n/k);
		// if(n%2){
			// double res = (r-1)*1.0/(n/k),res1 = (r+1)*1.0/(n/k);
			// if((r-1)/(n/k)%2 == 1&&fabs(res-(r-1)/(n/k))<=eps){
				// return 1;
			// }
			// if((r+1)/(n/k)%2 == 1&&fabs(res1-(r+1)/(n/k))<=eps){
				// return 1;
			// }
			// return 0;
		// }else{
			// double res = (r)*1.0/(n/k);
			// if(fabs(res-(r)/(n/k))<=eps&&(r)/(n/k)%2 == 1){
				// return 1;
			// }
			// return 0;
		// }
	// }
	if(n & 1){
		ll mor = n / k - 1;
		ll bu = k / 2;
		if(mor <= bu){
			ll sheng = max(n - n / k * k - bu,1ll);
			if(sheng == 1)return 1;
			else return 0;
		}
		else return 0;
	}else{
		ll mor = n / k;
		ll bu = k / 2;
		if(mor <= bu){
			ll sheng = max(n - n / k * k - bu,0ll);
			if(sheng == 0)return 1;
			else return 0;
		}
		else return 0;
	}
	return true;
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int _ = 1;
	cin >> _;
	while (_--)
	{
		if (solve()) cout << "Yes\n";
		else cout << "No\n";
	}
	return 0;
}