#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	else return gcd(b, a%b);
}
long long lcm(long long x, long long y) {
	return x * y / gcd(x, y);
}
long long f(long long x, long long y) {
	return ((x + (y - 1)) / y)*y;
}
int cnt(vector<long long> v) {
	set<long long>st;
	rep(i, v.size())if (v[i] < v.back())st.insert(v[i]);
	return st.size();
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		long long x, a, b; cin >> x >> a >> b;
		if (a > b)swap(a, b);
		if (1 == b) {
			cout << 1 << endl;
			continue;
		}
		if (1 == a) {
			if (0 != x % b)cout << 2 << endl;
			else cout << 1 << endl;
			continue;
		}
		if (a == b) {
			if (0 != x % b)cout << 2 << endl;
			else cout << 1 << endl;
			continue;
		}
		long long xa = f(x, a);
		long long xb = f(x, b);
		long long xab = f(xa, b);
		long long xba = f(xb, a);
		mint ans = cnt({ x,xa,xb,xab,xba });
		x = xba;
		long long g = gcd(a, b);
		x /= g;
		a /= g;
		b /= g;
		if (0 == x % b) {
			ans++;
		}
		else {
			ans += 2;
			long long l, r;
			if (a >= LINF / b) {
				l = a;
				r = f(x, b) / b;
			}
			else {
				l = a * b;
				l = ((x + (l - 1)) / l)*l;
				l /= b;
				r = f(x, b) / b;
			}
			ans += (l - r) * 2;
		}
		cout << ans.val() << endl;
	}
	return 0;
}