#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int gcd(int a, int b, int& x, int& y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int x1, y1;
    int d = gcd(b, a % b, x1, y1);
    x = y1;
    y = x1 - y1 * (a / b);
    return d;
}

bool find_any_solution(int a, int b, int c, int &x0, int &y0, int &g) {
    g = gcd(abs(a), abs(b), x0, y0);
    if (c % g) {
        return false;
    }

    x0 *= c / g;
    y0 *= c / g;
    if (a < 0) x0 = -x0;
    if (b < 0) y0 = -y0;
    return true;
}
void solve() {
    int n, k;
    cin >> n >> k;
    if (k == 1) {
        cout << (n == 1 ? "Yes" : "No") << "\n";
        return;
    }
    if (k % 2 == 0) {
        cout << "Yes\n";
        return;
    }
    if (n % k == 0) {
        cout << (n == k ? "Yes" : "No") << "\n";
        return;
    }
    int a = n / k;
    int b = 2;
    int c = (n % 2) - n % k;
    int m = 0, bt = 0, g = 0;
    if (!find_any_solution(a, b, c, m, bt, g)) {
        cout << "No\n";
        return;
    }
    int x = b / gcd(a, b);
    int y = a / gcd(a, b);
    // cout << m << " " << bt << " " << x << " " << y << "\n";
    if (m >= k) {
        int t = (m - k + x - 1) / x;
        m -= t * x;
        bt += t * y;
    }
    // cout << m << " " << bt << " " << x << " " << y << "\n";
    int t = (k - 1 - m) / x;
    m += t * x;
    bt -= t * y;
    // cout << m << " " << bt << " " << x << " " << y << "\n";
    if (bt < -(n % k)) {
        int t = (-(n % k) - bt + y - 1) / y;
        m -= t * x;
        bt += t * y;
    }
    // cout << m << " " << bt << " " << x << " " << y << "\n";
    if (0 <= m && m < k && 0 <= -bt && -bt <= n % k) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}