#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
void err(istream_iterator<string> it) { cout << '\n'; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << "[" << *it << " = " << a << "] ";
  err(++it, args...);
}
pair<int, int> dx[] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
const int inf = 2e9 + 7;
const long long INF = 3e18 + 7;
const long double pi = 3.1415926535897932384626433;
const double eps = 1e-6;
const long double EPS = 1e-9;
long long mod = 1e9 + 7;
const long long MOD = 1e15 + 7;
const bool multiple_tests = 0;
const int N = 1e6 + 7;
mt19937 lol(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());
long long bp(long long a, long long n) {
  if (n == 0) return 1;
  long long res = bp(a, n / 2);
  res = res * res % mod;
  if (n % 2) res = res * a % mod;
  return res;
}
long long inv(long long a) { return bp(a, mod - 2); }
long long fact[101], rfact[101];
void solve() {
  mod = 998244353;
  long long d;
  cin >> d;
  long long sq = sqrt(d);
  vector<long long> p;
  for (long long i = 2; i <= sq; i++) {
    if (d % i == 0) {
      p.push_back(i);
      while (d % i == 0) d /= i;
    }
  }
  if (d > 1) p.push_back(d);
  fact[0] = 1;
  for (long long i = 1; i <= 100; i++) fact[i] = fact[i - 1] * i % mod;
  rfact[100] = inv(fact[100]);
  for (long long i = 99; i >= 0; i--) {
    rfact[i] = rfact[i + 1] * (i + 1) % mod;
  }
  long long q;
  cin >> q;
  while (q--) {
    long long a, b;
    long long suma = 0, sumb = 0;
    cin >> a >> b;
    vector<long long> down, up;
    for (long long e : p) {
      long long cnt = 0;
      while (a % e == 0) {
        cnt++;
        a /= e;
      }
      while (b % e == 0) {
        cnt--;
        b /= e;
      }
      if (cnt > 0)
        down.push_back(cnt), suma += cnt;
      else
        up.push_back(-cnt), sumb += -cnt;
    }
    long long ans = fact[suma];
    for (long long e : down) {
      ans = ans * rfact[e] % mod;
    }
    ans = ans * fact[sumb] % mod;
    for (long long e : up) {
      ans = ans * rfact[e] % mod;
    }
    cout << ans << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long TT = 1;
  if (multiple_tests) cin >> TT;
  for (long long testcase = 1; testcase <= TT; testcase++) {
    solve();
    cout << '\n';
  }
  return 0;
}
