#include <bits/stdc++.h>
using namespace std;
long long M = 998244353;
vector<long long> prime;
void pre(long long D) {
  for (long long i = 2; i <= sqrt(D); i++) {
    if (D % i == 0) {
      while (D % i == 0) {
        D /= i;
      }
      prime.push_back(i);
    }
  }
  if (D > 1) prime.push_back(D);
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) res = (res * x) % M;
    y = y >> 1;
    x = (x * x) % M;
  }
  return res % M;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long D;
  cin >> D;
  pre(D);
  long long fact[200];
  fact[0] = 1;
  for (int i = 1; i < 200; i++) fact[i] = (fact[i - 1] * i) % M;
  long long inv[200];
  inv[0] = 1;
  inv[1] = 1;
  for (int i = 2; i < 200; i++) inv[i] = power(fact[i], M - 2);
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    long long u, v;
    cin >> u >> v;
    if (u == v) {
      cout << 1 << '\n';
      continue;
    }
    vector<long long> up, down;
    long long fd = 0, fu = 0;
    for (auto it : prime) {
      long long cc = 0;
      while (u % it == 0) {
        u /= it;
        cc--;
      }
      while (v % it == 0) {
        v /= it;
        cc++;
      }
      if (cc < 0) {
        down.push_back(-cc);
        fd -= cc;
      } else if (cc > 0) {
        up.push_back(cc);
        fu += cc;
      }
    }
    long long ans = fact[fd];
    for (auto h : down) ans = (ans * inv[h]) % M;
    ans = (ans * fact[fu]) % M;
    for (auto h : up) ans = (ans * inv[h]) % M;
    cout << ans << '\n';
  }
  return 0;
}
