#include <bits/stdc++.h>
using namespace std;
constexpr static int MOD = 998244353;
constexpr static int MAXN = 1000;
int64_t D;
vector<pair<int64_t, int>> primes;
map<int64_t, vector<int>> factors;
int64_t inv[MAXN], factorial[MAXN], inv_factorial[MAXN];
void dfs(int64_t val, int i, vector<int>& f) {
  if (i == primes.size()) {
    factors[val] = f;
    return;
  }
  for (int j = 0; j <= primes[i].second; j++) {
    f.push_back(j);
    dfs(val, i + 1, f);
    f.pop_back();
    val *= primes[i].first;
  }
}
void preprocess() {
  for (int64_t i = 2; i * i <= D; i++) {
    if (D % i == 0) {
      D /= i;
      int e = 1;
      while (D % i == 0) D /= i, e++;
      primes.push_back({i, e});
    }
  }
  if (D > 1) primes.push_back({D, 1});
  vector<int> f;
  dfs(1, 0, f);
  inv[1] = 1;
  for (int i = 2; i < MAXN; i++)
    inv[i] = (MOD - (MOD / i) * inv[MOD % i] % MOD) % MOD;
  factorial[0] = 1;
  inv_factorial[0] = 1;
  for (int i = 1; i < MAXN; i++) {
    factorial[i] = factorial[i - 1] * i % MOD;
    inv_factorial[i] = inv_factorial[i - 1] * inv[i] % MOD;
  }
}
int64_t query(int64_t u, int64_t v) {
  int64_t r = 1;
  auto f1 = factors[u];
  auto f2 = factors[v];
  int neg_total = 0;
  int pos_total = 0;
  for (int i = 0; i < f1.size(); i++) {
    int k = f2[i] - f1[i];
    if (k < 0) neg_total += -k;
    if (k > 0) pos_total += k;
    r = r * inv_factorial[abs(k)] % MOD;
  }
  r = r * factorial[neg_total] % MOD;
  r = r * factorial[pos_total] % MOD;
  return r;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> D;
  preprocess();
  int Q;
  cin >> Q;
  while (Q--) {
    int64_t u, v;
    cin >> u >> v;
    cout << query(u, v) << '\n';
  }
  cout.flush();
}
