#include <bits/stdc++.h>

using namespace std;

#define int long long

using vi = vector<int>;
using db = long double;

constexpr int inf = 1E18;


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

//int n , k = 11;
void solve() {
    int n, k;
    cin >> n >> k;
//    cout << n << " :  ";
    if (n == k and n == 1) {
        cout << "Yes\n";
        return;
    }
    if (k % 2 == 0) {
        cout << "Yes\n";
        return;
    }
    if (n > k * 10) {
        cout << "No\n";
        return;
    }
    if (k == 1) {
        cout << "No\n";
        return;
    }

    int a = n / k, b = (n + k - 1) / k, c = n / 2, x0, y0, d;
    d = exgcd(a, b, x0, y0);
    if (c % d != 0) {
        cout << "No\n";
        return;
    }
    int x = c / d * x0, y = c / d * y0, dx = b / d, dy = a / d;
    {
        int kk = (-x) / dx;
        x = x + kk * dx, y = y - kk * dy;
    }
    for (; y >= 0; x += dx, y -= dy) {
        if (x < 0) continue;
        if (n % k != 0 and x + y <= k and x <= k - n % k and y <= n % k) {
//                    cout << a << " * " << x << " + " << b << " * " << y << " = " << c << "\n";
            cout << "Yes\n";
            return;
        } else if (n % k == 0 and x + y <= k and min(x, y) == 0) {
//                    cout << a << " * " << x << " + " << b << " * " << y << " = " << c << "\n";
            cout << "Yes\n";
            return;
        }
    }
    cout << "No\n";


    return;
}

int32_t main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int TC;
//    n = k;
    for (cin >> TC; TC; TC--)
        solve();
    return 0;
}