#include <stdio.h>

long long floor_sum(long long n, long long m, long long a, long long b)
{
	if (a >= m || b >= m) return n * (n - 1) * (a / m) / 2 + n * (b / m) + floor_sum(n, m, a % m, b % m);
	long long y = (n * a + b) / m, x = m * y - b;
	if (y == 0) return 0;
	else return (n - (x + a - 1) / a) * y + floor_sum(y, a, m, (a - x % a) % a);
}

long long solve(int N, int A, int B)
{
	int a = N + 1 - N / A * A, b = N + 1 - N / B * B;
	return (long long)(N + 1 + a) * ((N + 1 - a) / A + 1) / 2 + (long long)(N + 1 + b) * ((N + 1 - b) / B + 1) / 2 - floor_sum((N + 1 - a) / A + 1, B, A, a - 1) - ((N + 1 - a) / A + 1) - (N + 1) * 2 + 1;
}

int main()
{
	int t, T, N, A, B;
	scanf("%d", &T);
	for (t = 1; t <= T; t++) {
		scanf("%d %d %d", &N, &A, &B);
		printf("%lld\n", solve(N, A, B));
	}
	fflush(stdout);
	return 0;
}