#include <bits/stdc++.h>
using namespace std;
class modint {
 public:
  modint() : n_(0) {}
  modint(int n) : n_(n) {}
  int Int() { return n_; }
  modint operator+(modint y) { return add(n_, y.n_); }
  modint operator+=(modint y) {
    n_ = add(n_, y.n_);
    return *this;
  }
  modint operator-(modint y) { return add(n_, -y.n_); }
  modint operator-=(modint y) {
    n_ = add(n_, -y.n_);
    return *this;
  }
  modint operator*(modint y) { return mul(n_, y.n_); }
  modint operator*=(modint y) {
    n_ = mul(n_, y.n_);
    return *this;
  }
  modint operator/(modint y) { return divide(n_, y.n_); }
  modint operator/=(modint y) {
    n_ = divide(n_, y.n_);
    return *this;
  }
  modint operator^(long long y) { return binpow(n_, y); }
  modint operator^=(long long y) {
    n_ = binpow(n_, y);
    return *this;
  }

 private:
  int add(int x, int y) {
    x += y;
    while (x >= mod_) x -= mod_;
    while (x < 0) x += mod_;
    return x;
  }
  int mul(int x, int y) { return (x * 1ll * y) % mod_; }
  int binpow(int x, long long y) {
    int z = 1;
    while (y) {
      if (y & 1) z = mul(z, x);
      x = mul(x, x);
      y >>= 1;
    }
    return z;
  }
  int inv(int x) { return binpow(x, mod_ - 2); }
  int divide(int x, int y) { return mul(x, inv(y)); }
  static const int mod_ = 998244353;
  int n_;
};
long long gcd(long long x, long long y) {
  if (y == 0) {
    return x;
  }
  return gcd(y, x % y);
}
shared_ptr<vector<long long>> GetFacList(long long n) {
  auto fac_list = make_shared<vector<long long>>();
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      fac_list->push_back(i);
      while (n % i == 0) {
        n /= i;
      }
    }
  }
  if (n > 1) {
    fac_list->push_back(n);
  }
  return fac_list;
}
void Solve() {
  long long d;
  int q;
  cin >> d >> q;
  auto fac_list_ptr = GetFacList(d);
  auto& fac = *fac_list_ptr;
  map<long long, modint> init;
  init[1] = 1;
  function<modint(long long)> dfs;
  dfs = [&](long long num) {
    if (init.find(num) != end(init)) {
      return init[num];
    }
    auto& count = init[num];
    for (auto f : fac) {
      if (num % f == 0) {
        count += dfs(num / f);
      }
    }
    return count;
  };
  dfs(d);
  long long u, v;
  for (int i = 0; i < q; i++) {
    cin >> u >> v;
    modint ans = 1;
    auto c = gcd(u, v);
    ans *= init[u / c];
    ans *= init[v / c];
    printf("%d\n", ans.Int());
  }
}
int main(int argc, char** argv) {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int t = 1;
  while (t--) {
    Solve();
  }
  return 0;
}
