#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
  int v = 0, f = 1;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = (c & 15);
  while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15);
  x = v * f;
}
inline void read(long long &x) {
  long long v = 0ll, f = 1ll;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = (c & 15);
  while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15);
  x = v * f;
}
inline void readc(char &x) {
  char c;
  while (((c = getchar()) == ' ') || c == '\n')
    ;
  x = c;
}
inline void writes(string s) { puts(s.c_str()); }
inline void writeln() { writes(""); }
inline void writei(int x) {
  if (x < 0) {
    putchar('-');
    x = abs(x);
  }
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
inline void writell(long long x) {
  if (x < 0) {
    putchar('-');
    x = abs(x);
  }
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
long long n, m, i, j, t, pc, f[100005], ans[100005];
int p[31600005];
bitset<31600005> np;
map<long long, vector<pair<long long, long long> > > mp;
vector<long long> d;
long long exgcd(long long x, long long y, long long &a, long long &b) {
  if (!y) {
    a = 1;
    b = 0;
    return x;
  }
  long long g = exgcd(y, x % y, b, a);
  b -= x / y * a;
  return g;
}
long long mul(long long x, long long y, long long mod) {
  long long z = 0;
  while (y) {
    if (y & 1) (z += x) %= mod;
    (x += x) %= mod;
    y /= 2;
  }
  return z;
}
void gd(long long x) {
  d.clear();
  long long i;
  for (i = 1; i <= pc; i++) {
    if (x % p[i] == 0) {
      d.push_back(p[i]);
      while (x % p[i] == 0) x /= p[i];
    }
  }
  if (x > 1) d.push_back(x);
}
void solve(long long x, vector<pair<long long, long long> > qrys) {
  if (x == 1) return;
  int i;
  gd(x);
  if (d.size() == 1) {
    for (__typeof((qrys).begin()) it = (qrys).begin(); it != (qrys).end();
         it++) {
      if (it->first % x == 0) ans[it->second] = 1;
    }
    return;
  }
  if (d.size() == 2) {
    for (__typeof((qrys).begin()) it = (qrys).begin(); it != (qrys).end();
         it++) {
      long long x, y;
      long long g = exgcd(d[0], d[1], x, y);
      long long mod = d[1] / g;
      if (it->first % g != 0) continue;
      x %= mod;
      x += mod;
      x %= mod;
      x = mul(x, it->first / g, mod);
      if (x * d[0] <= it->first) ans[it->second] = 1;
    }
    return;
  }
  memset((f), (0x16), (sizeof((f))));
  f[0] = 0;
  priority_queue<pair<long long, long long> > pq;
  pq.push(make_pair(0, 0));
  while (!pq.empty()) {
    long long x = pq.top().second, y = -pq.top().first;
    pq.pop();
    if (f[x] != y) continue;
    for (i = 1; i < d.size(); i++) {
      long long y = (x + d[i]) % d[0], z = f[x] + (x + d[i]) / d[0];
      if (f[y] > z) {
        f[y] = z;
        pq.push(make_pair(-z, y));
      }
    }
  }
  for (__typeof((qrys).begin()) it = (qrys).begin(); it != (qrys).end(); it++) {
    if (f[it->first % d[0]] <= it->first / d[0]) ans[it->second] = 1;
  }
}
int main() {
  for ((i) = (2); (i) <= (31600000); (i)++) {
    if (!np[i]) {
      p[++pc] = i;
    }
    for (j = 1; j <= pc; j++) {
      if (i * p[j] > 31600000) break;
      np[i * p[j]] = 1;
      if (i % p[j] == 0) break;
    }
  }
  read(t);
  for (((i)) = (1); ((i)) <= ((t)); ((i))++) {
    long long x, y;
    read(x);
    read(y);
    mp[y].push_back(make_pair(x, i));
  }
  for (__typeof((mp).begin()) it = (mp).begin(); it != (mp).end(); it++) {
    solve(it->first, it->second);
  }
  for (((i)) = (1); ((i)) <= ((t)); ((i))++) {
    if (ans[i])
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
