#include <bits/stdc++.h>
using namespace std;
void fastIO() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
template <typename T, typename U>
inline void mnze(T &x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
inline void mxze(T &x, U y) {
  if (x < y) x = y;
}
void _scan(int &x) { scanf("%d", &x); }
void _scan(long long &x) { scanf("%lld", &x); }
void _scan(double &x) { scanf("%lf", &x); }
void _scan(char &x) { scanf(" %c", &x); }
void _scan(char *x) { scanf("%s", x); }
template <typename T>
void _scan(vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) _scan(v[i]);
}
void scan() {}
template <typename T, typename... U>
void scan(T &head, U &...tail) {
  _scan(head);
  scan(tail...);
}
template <typename T>
void _dbg(const char *sdbg, T h) {
  cerr << sdbg << "=" << h << "\n";
}
template <typename T, typename... U>
void _dbg(const char *sdbg, T h, U... t) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << "=" << h << ",";
  _dbg(sdbg + 1, t...);
}
long long MOD = 998244353;
inline long long Msum(long long x) { return x; }
template <typename... Rest>
inline long long Msum(long long x, Rest... rest) {
  return (x + Msum(rest...)) % MOD;
}
inline long long Mprod(long long x) { return x; }
template <typename... Rest>
inline long long Mprod(long long x, Rest... rest) {
  return x * Mprod(rest...) % MOD;
}
inline long long Mnorm(long long x) { return (x % MOD + MOD) % MOD; }
inline long long sq(long long x) { return x * x % MOD; }
inline long long pot(long long b, long long e) {
  if (!e) return 1;
  return sq(pot(b, e >> 1)) * (e & 1 ? b : 1) % MOD;
}
inline long long inv(long long x) { return pot(x, MOD - 2); }
vector<long long> p;
vector<long long> geta(long long x) {
  vector<long long> r(p.size());
  for (int i = 0; i < (int)p.size(); i++) {
    while (x % p[i] == 0) {
      x /= p[i];
      r[i]++;
    }
  }
  return (r);
}
long long fact[1000];
int main() {
  long long D;
  scan(D);
  long long aux = D;
  for (long long d = 2; d * d <= aux; d++) {
    if (aux % d == 0) {
      p.push_back(d);
      while (aux % d == 0) {
        aux /= d;
      }
    }
  }
  if (aux > 1) p.push_back(aux);
  fact[0] = 1;
  for (int i = 1; i < 1000; i++) fact[i] = fact[i - 1] * i % MOD;
  int q;
  scan(q);
  while (q--) {
    long long x, y;
    scan(x, y);
    vector<long long> a = geta(x);
    vector<long long> b = geta(y);
    long long p = 0, q = 1;
    long long p2 = 0, q2 = 1;
    for (int i = 0; i < (int)a.size(); i++) {
      int d = a[i] - b[i];
      if (d >= 0) {
        q = q * fact[d] % MOD;
        p = p + d;
      } else {
        d = -d;
        q2 = q2 * fact[d] % MOD;
        p2 = p2 + d;
      }
    }
    p = fact[p];
    p2 = fact[p2];
    long long ans = (p * inv(q) % MOD) * (p2 * inv(q2) % MOD);
    printf("%lld\n", ans % MOD);
  }
}
