#include<bits/stdc++.h>
using namespace std;
int pan(int c,int a,int b,int d);
int nap(int c,int a,int b,int d);
long long panduan(int c,int a,int b,int d){
	int A=a,C=c;
	a%=b;c%=b;
	if(c>=d)return C;
	if(!a)return LLONG_MAX;
	c=b-1-c;a=b-a;d=b-1-d;
	int kk=pan(c,a,b,d);
	if(kk==-1)return LLONG_MAX;
	return C+1ll*kk*A;
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		long long n;
		int a,b;
		scanf("%lld%d%d",&n,&a,&b);
		long long l=1ll*a*b/__gcd(a,b);
		long long yc=n/a+n/b-2*(n/l);
		int ra=n%a,rb=n%b;
		long long rl=n%l;
		int ys=(rl>min(ra,rb));
		if(panduan(ra,a,b,rb)<rl)ys=2;
		if(panduan(rb,b,a,ra)<rl)ys=2;
		printf("%lld\n",n-yc+ys);
	}
	return 0;
}
int pan(int c,int a,int b,int d){
	if(c<=d)return 0;
	if(a==0)return -1;
	if(2*a>b)return nap(b-1-c,b-a,b,b-1-d);
	int k1=(b-c+a-1)/a,cc=(c+1ll*k1*a)%b;
	int aa=(a-b%a)%a;
	int cs=pan(cc,aa,a,d);
	if(cs==-1)return -1;
	int an=(b+a-1)/a*cs+k1-(cc+1ll*aa*cs)/a;
	return an;
}
int nap(int c,int a,int b,int d){
	if(c>=d)return 0;
	if(a==0)return -1;
	if(2*a>b)return pan(b-1-c,b-a,b,b-1-d);
	int k1=(d-c+a-1)/a,cc=c+k1*a;
	if(cc<b)return k1;
	int cs=pan(cc-b+d+1,a,b,d);
	if(cs==-1)return -1;
	return cs+k1;
}