#include <bits/stdc++.h>
using namespace std;
long long int t;
map<long long int, vector<pair<long long int, long long int>>> qur;
bool p[32000000];
vector<long long int> primes;
vector<pair<long long int, long long int>> adj[1000005];
long long int dist[1000005];
set<pair<long long int, long long int>> s;
string ans[100005];
long long int powmod(long long int a, long long int b, long long int m) {
  long long int an = 1;
  while (b > 0) {
    if ((b & 1)) an = (an * a) % m;
    b >>= 1;
    a = (a * a) % m;
  }
  return an;
}
vector<long long int> get_prime_list(long long int x) {
  vector<long long int> an;
  for (auto j : primes) {
    if (j * j > x) break;
    if (x % j == 0) {
      while (x % j == 0) x /= j;
      an.push_back(j);
    }
  }
  if (x > 1) an.push_back(x);
  if (an.size() == 0) an.push_back(2e18);
  return an;
}
void dij() {
  dist[0] = 0;
  s.insert({0, 0});
  while (s.size()) {
    long long int i = s.begin()->second;
    long long int d = s.begin()->first;
    s.erase(s.begin());
    for (auto j : adj[i]) {
      if (dist[j.first] > dist[i] + j.second) {
        auto h = s.find({dist[j.first], j.first});
        if (h != s.end()) s.erase(h);
        dist[j.first] = dist[i] + j.second;
        s.insert({dist[j.first], j.first});
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  memset(p, 1, sizeof p);
  for (int i = 2; i <= 1e4; i++) {
    if (p[i]) {
      for (int j = i * i; j <= 32000000; j += i) {
        p[j] = 0;
      }
    }
  }
  for (int i = 2; i <= 32000000; i++)
    if (p[i]) primes.push_back(i);
  for (int i = 1; i <= t; i++) {
    long long int x, y;
    cin >> x >> y;
    qur[y].push_back({x, i});
  }
  for (auto j : qur) {
    long long int k = j.first;
    vector<long long int> pl = get_prime_list(k);
    if (pl.size() == 1) {
      for (auto pn : j.second) {
        ans[pn.second] = (pn.first % pl[0] == 0 ? "YES\n" : "NO\n");
      }
    } else if (pl.size() == 2) {
      for (auto pn : j.second) {
        if (pn.first >= ((pl[0] - 1) * (pl[1] - 1)))
          ans[pn.second] = "YES\n";
        else {
          long long int x = pl[0];
          long long int y = pl[1];
          long long int z = powmod(y % x, x - 2, x);
          z = (z * (pn.first % x)) % x;
          if (pn.first >= z * y)
            ans[pn.second] = "YES\n";
          else
            ans[pn.second] = "NO\n";
        }
      }
    } else {
      for (int i = 0; i < pl[0]; i++) {
        dist[i] = 1e18;
        adj[i].clear();
      }
      for (auto h : pl) {
        for (int i = 0; i < pl[0]; i++) {
          adj[i].push_back({(i + h) % pl[0], h});
        }
      }
      dij();
      for (auto pn : j.second)
        ans[pn.second] =
            (pn.first >= (dist[pn.first % pl[0]]) ? "YES\n" : "NO\n");
    }
  }
  for (int i = 1; i <= t; i++) cout << ans[i];
  return 0;
}
