#include <bits/stdc++.h>
using namespace std;
long long int const rem = 998244353;
vector<long long int> prime_factors;
vector<long long int> factorial;
vector<long long int> inverse_fac;
long long int modInverse(long long int a) {
  long long int m = rem;
  long long int m0 = m;
  long long int y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long int q = a / m;
    long long int t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
void compute() {
  factorial.resize(100);
  inverse_fac.resize(100);
  factorial[0] = 1;
  for (long long int i = 1; i < 100; i++)
    factorial[i] = (factorial[i - 1] * i) % rem;
  for (long long int i = 0; i < 100; i++)
    inverse_fac[i] = modInverse(factorial[i]);
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void primeFactors(long long int n) {
  if (n % 2 == 0) prime_factors.push_back(2);
  while (n % 2 == 0) n = n / 2;
  for (long long int i = 3; i * i <= n; i = i + 2) {
    if (n % i == 0) {
      prime_factors.push_back(i);
      while (n % i == 0) n = n / i;
    }
  }
  if (n > 2) prime_factors.push_back(n);
}
long long int comb(long long int n, long long int r) {
  long long int answer = factorial[n];
  answer = (answer * inverse_fac[n - r]) % rem;
  answer = (answer * inverse_fac[r]) % rem;
  return answer;
}
long long int count(long long int n) {
  long long int answer = 1;
  vector<long long int> a;
  long long int cnt = 0;
  long long int total = 0;
  for (long long int i : prime_factors) {
    cnt = 0;
    while (n % i == 0) {
      n = n / i;
      cnt++;
    }
    total += cnt;
    if (cnt > 0) a.push_back(cnt);
  }
  for (long long int i : a) {
    answer = (answer * comb(total, i)) % rem;
    total -= i;
  }
  return answer;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  compute();
  long long int d;
  cin >> d;
  primeFactors(d);
  long long int q;
  cin >> q;
  while (q--) {
    long long int u, v;
    cin >> u >> v;
    long long int w = gcd(u, v);
    u = u / w;
    v = v / w;
    long long int facu = count(u);
    long long int facv = count(v);
    cout << (facu * facv) % rem << '\n';
  }
}
