#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long a[100], b[100];
long long c[100000][100];
long long f[100000], g[100000];
const int mod = 998244353;
long long qpow(long long a, long long n) {
  long long re = 1;
  while (n > 0) {
    if (n & 1) {
      re *= a;
      re %= mod;
    }
    a *= a;
    a %= mod;
    n >>= 1;
  }
  return re;
}
int main() {
  f[0] = g[0] = 1;
  for (long long i = 1; i < 100000; i++) {
    f[i] = f[i - 1] * i;
    f[i] %= mod;
    g[i] = qpow(f[i], mod - 2);
  }
  long long d;
  scanf("%lld", &d);
  int q;
  scanf("%d", &q);
  if (d == 1) {
    while (q--) {
      printf("1\n");
    }
    return 0;
  }
  long long temp = d;
  int now = 0;
  for (int i = 2; i <= sqrt(d); i++) {
    if (temp % i == 0) {
      a[++now] = i;
      while (temp % i == 0) {
        b[now]++;
        temp /= i;
      }
    }
  }
  if (temp > 1) {
    a[++now] = temp;
    b[now]++;
  }
  for (int i = 1; i <= sqrt(d); i++) {
    if (d % i == 0) {
      v.push_back(i);
      v.push_back(d / i);
    }
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < v.size() / 2; i++) {
    long long temp = v[i];
    for (int j = 1; j <= now; j++) {
      while (temp % a[j] == 0) {
        temp /= a[j];
        c[i][j]++;
      }
      c[v.size() - 1 - i][j] = b[j] - c[i][j];
    }
  }
  while (q--) {
    long long x, y;
    scanf("%lld%lld", &x, &y);
    int pos1 = lower_bound(v.begin(), v.end(), x) - v.begin();
    int pos2 = lower_bound(v.begin(), v.end(), y) - v.begin();
    long long ans = 1;
    int cnt1 = 0, cnt2 = 0;
    for (int i = 1; i <= now; i++) {
      if (c[pos1][i] == c[pos2][i]) {
        continue;
      } else if (c[pos1][i] > c[pos2][i]) {
        cnt1 += abs(c[pos1][i] - c[pos2][i]);
      } else if (c[pos2][i] > c[pos1][i]) {
        cnt2 += abs(c[pos1][i] - c[pos2][i]);
      }
      ans *= g[abs(c[pos1][i] - c[pos2][i])];
      ans %= mod;
    }
    ans *= f[cnt1];
    ans %= mod;
    ans *= f[cnt2];
    ans %= mod;
    printf("%lld\n", ans);
  }
}
