#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7;
const int inf = INT_MAX;
const long long inff = 1e18;
const long long mod = 998244353;
long long d;
vector<long long> primes;
long long p[maxn], invp[maxn];
long long ppow(long long x, long long y) {
  if (y == 0) return 1;
  long long ret = ppow(x, y / 2);
  ret = ret * ret % mod;
  if (y & 1) ret = ret * x % mod;
  return ret;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  p[0] = invp[0] = 1;
  for (long long i = 1; i <= 1000000; i++)
    p[i] = p[i - 1] * i % mod, invp[i] = ppow(p[i], mod - 2);
  cin >> d;
  for (long long i = 2; i * i <= d; i++) {
    if (d % i == 0) {
      primes.push_back(i);
      while (d % i == 0) d /= i;
    }
  }
  if (d != 1) primes.push_back(d);
  long long q;
  cin >> q;
  while (q--) {
    long long x, y;
    cin >> x >> y;
    long long sum1 = 0, sum2 = 0;
    long long ans = 1;
    for (long long i : primes) {
      long long cnt1 = 0, cnt2 = 0;
      while (x % i == 0) x /= i, cnt1++;
      while (y % i == 0) y /= i, cnt2++;
      if (cnt1 > cnt2)
        sum1 += cnt1 - cnt2;
      else
        sum2 += cnt2 - cnt1;
      ans = ans * invp[abs(cnt1 - cnt2)] % mod;
    }
    cout << p[sum1] * p[sum2] % mod * ans % mod << '\n';
  }
}
