#include <bits/stdc++.h>
using namespace std;
long long D, Q, V, U, ans;
vector<long long> primes;
void findPrimeFactors(long long n) {
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      primes.push_back(i);
      while (n != 0 && n % i == 0) {
        n /= i;
      }
    }
  }
  if (n > 1) {
    primes.push_back(n);
  }
}
map<long long, long long> pf[2], gcd;
void findPrimeFactorsByPrimes(long long n, map<long long, long long>& pfs) {
  for (long long i = 0; i < primes.size(); i++) {
    long long cnt = 0;
    while (n != 0 && n % primes[i] == 0) {
      cnt++;
      n /= primes[i];
    }
    if (cnt != 0) {
      pfs[primes[i]] = cnt;
    }
  }
}
vector<long long> inv, rf, f;
void updateInverseModular(int N) {
  inv.resize(N + 1);
  rf.resize(N + 1);
  inv[1] = 1;
  rf[0] = rf[1] = 1;
  for (long long i = 2; i <= N; i++) {
    inv[i] = 998244353 - (998244353 / i) * inv[998244353 % i] % 998244353;
    rf[i] = rf[i - 1] * inv[i] % 998244353;
  }
}
void updateFactorial(int N) {
  f.resize(N + 1);
  f[0] = f[1] = 1;
  for (long long i = 2; i <= N; i++) {
    f[i] = f[i - 1] * i % 998244353;
  }
}
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  cin >> D;
  findPrimeFactors(D);
  updateFactorial(50);
  updateInverseModular(50);
  cin >> Q;
  for (int i = 0; i < Q; i++) {
    cin >> U >> V;
    ans = 1;
    pf[0].clear();
    pf[1].clear();
    gcd.clear();
    findPrimeFactorsByPrimes(U, pf[0]);
    findPrimeFactorsByPrimes(V, pf[1]);
    for (auto iter = pf[0].begin(); iter != pf[0].end(); iter++) {
      long long num = (*iter).first;
      if (pf[1].count(num) != 0) {
        gcd[num] = pf[0][num] < pf[1][num] ? pf[0][num] : pf[1][num];
      }
    }
    vector<long long> t;
    long long tcnt;
    t.clear();
    tcnt = 0;
    for (auto iter = pf[0].begin(); iter != pf[0].end(); iter++) {
      long long num = (*iter).first, cnt = (*iter).second;
      if (gcd.count(num) != 0) {
        if (cnt > gcd[num]) {
          t.push_back(cnt - gcd[num]);
          tcnt += cnt - gcd[num];
        }
      } else {
        t.push_back(cnt);
        tcnt += cnt;
      }
    }
    ans = (ans * f[tcnt]) % 998244353;
    for (int i = 0; i < t.size(); i++) {
      ans = (ans * rf[t[i]]) % 998244353;
    }
    t.clear();
    tcnt = 0;
    for (auto iter = pf[1].begin(); iter != pf[1].end(); iter++) {
      long long num = (*iter).first, cnt = (*iter).second;
      if (gcd.count(num) != 0) {
        if (cnt > gcd[num]) {
          t.push_back(cnt - gcd[num]);
          tcnt += cnt - gcd[num];
        }
      } else {
        t.push_back(cnt);
        tcnt += cnt;
      }
    }
    ans = (ans * f[tcnt]) % 998244353;
    for (int i = 0; i < t.size(); i++) {
      ans = (ans * rf[t[i]]) % 998244353;
    }
    cout << ans << '\n';
  }
  return 0;
}
