#include <bits/stdc++.h>
// #include<bits/extc++.h>
#define int long long
#define endl '\n'
#define eps 1e-7
#define pb push_back
#define eb emplace_back
#define debug(x) cerr << #x << ": " << x << '\n';
// using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using ull = unsigned long long;
const int N = 1e6 + 5, MOD = 1e9 + 7;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
int n, k;
int exgcd(int a, int b, int& x, int& y) {
    if (!b) {
        x = 1, y = 0;
        return a;
    }
    int d = exgcd(b, a % b, x,y);
    int t=x;
    x=y;
    y =t- (a / b) * y;
    return d;
}
void isac()
{
    cin>>n>>k;
    if(n == 1) {
        std::cout << "Yes\n";
        return;
    }
    if(k == 1) {
        std::cout << "No\n";
        return;
    }
    int l1 = n/k, c1 = k - (n % k), l2 = n/k + 1, c2 = n % k;
    int cnt = n/2;
    if(l1 % 2 == 0) swap(l1, l2), swap(c1, c2);
    int x, y;
    exgcd(l1, l2, x, y);
    int l = std::max(((-cnt * y) + l1 - 1)/l1, ((cnt * x -c1) + l2 - 1)/l2);int r = std::min((cnt * x)/l2, (c2 - cnt*y)/ l1);
    // cout << l1 << " " << c1 << " " << l2 << " " << c2 << "\n";
    // cout << x << " " << y << " " << l << " " << r << "\n";
    if(l > r) {
        std::cout << "No\n"; 
    }
    else std::cout << "Yes\n";

}
signed main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) isac();
    return 0;
}
/*
    Zena youth together.
    Such a pretty name.
    There will be a long story.
    Time will tell all.
*/