#include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
long long int binpow(long long int base, long long int exp) {
  base %= mod;
  long long int answer = 1;
  while (exp) {
    if (exp & 1) {
      answer *= base;
      answer %= mod;
    }
    base *= base;
    base %= mod;
    exp /= 2;
  }
  return answer;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int factorials[1000];
long long int inverseFactorials[1000];
long long int ways(vector<long long int>& freq) {
  long long int n = 0;
  for (auto& itr : freq) n += itr;
  long long int answer = factorials[n];
  for (auto& itr : freq) {
    answer = answer * inverseFactorials[itr];
    answer %= mod;
  }
  return answer;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  factorials[0] = 1;
  inverseFactorials[0] = 1;
  for (long long int i = 1; i < 1000; i++) {
    factorials[i] = factorials[i - 1] * i;
    factorials[i] %= mod;
    inverseFactorials[i] = binpow(factorials[i], mod - 2);
  }
  long long int d;
  cin >> d;
  set<long long int> primes;
  long long int n = d;
  while (n % 2 == 0) {
    primes.insert(2);
    n /= 2;
  }
  for (long long int i = 3; i * i <= n; i += 2) {
    while (n % i == 0) {
      primes.insert(i);
      n /= i;
    }
  }
  if (n > 2) primes.insert(n);
  vector<long long int> primeFactors(primes.begin(), primes.end());
  n = primeFactors.size();
  long long int q;
  cin >> q;
  while (q--) {
    long long int a, b;
    cin >> a >> b;
    vector<long long int> hash1(n, 0);
    vector<long long int> hash2(n, 0);
    long long int c = gcd(a, b);
    a /= c;
    b /= c;
    for (long long int i = 0; i < n; i++) {
      while (a % primeFactors[i] == 0) {
        a /= primeFactors[i];
        hash1[i]++;
      }
    }
    for (long long int i = 0; i < n; i++) {
      while (b % primeFactors[i] == 0) {
        b /= primeFactors[i];
        hash2[i]++;
      }
    }
    long long int waysA = ways(hash1), waysB = ways(hash2);
    long long int answer = waysA * waysB;
    answer %= mod;
    cout << answer << '\n';
  }
  return 0;
}
