#include <stdio.h>

const int Mod = 998244353;

long long gcd(long long a, long long b)
{
	if (a == 0) return b;
	else return gcd(b % a, a);
}

int solve(long long X, long long A, long long B)
{
	if (A == B) {
		if (X % A == 0) return 1;
		else return 2;
	} else if (A > B) {
		A ^= B;
		B ^= A;
		A ^= B;
	}
	
	long long G = gcd(A, B), L = A / G, ans = 1;
	if ((A - X % A) % A < (B - X % B) % B || X % B == 0) {
		if (X % A != 0) {
			ans++;
			X += (A - X % A) % A;
		} else if (X % B == 0) return 1;
	}
	if (X % B != 0) ans++;
	X += (B - X % B) % B;
	ans += (L - X / B) * 2;
	return ans % Mod;
}

int main()
{
	int T;
	long long X, A, B;
	scanf("%d", &T);
	while (T--) {
		scanf("%lld %lld %lld", &X, &A, &B);
		printf("%d\n", solve(X, A, B));
	}
	fflush(stdout);
	return 0;
}