#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

mint solve() {
  ll x, a, b;
  cin >> x >> a >> b;
  if (a > b) swap(a, b);
  if (a == b) return 1 + (x % a != 0);
  mint ans = 1;
  ll na = (x + a - 1) / a * a;
  ll nb = (x + b - 1) / b * b;
  if (na == nb) {
    if (na != x) ans++;
    return ans;
  }
  if (na > nb) {
    if (nb != x) ans++;
  } else {
    if (na != x) ans++;
    ans++;
  }
  // nb + t*b = 0 (mod a)
  // t*b = -nb (mod a)
  ll g = gcd(a, b);
  b /= g;
  a /= g;
  nb /= g;
  ll t = __int128(-nb % a + a) * inv_mod(b, a) % a;
  ans += 2 * t;
  return ans;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while(t--) cout << solve().val() << '\n';
}