#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd __gcd
int T,a,b;ll n,d,t,ans;
void W(ll &x,ll y) {x=max(x,y);}
ll dv(ll x,ll y) {return x>0?(x-1)/y+1:0;}
int find1(int x,int r,int y,int p,int w1,int w2)
{
	if(r<=y) return 0;if(x>=p) x-=p;
	if(!x) return -1;int d=(p-r-1)/x,t;r+=(d+1)*x-p;
	t=find1(x-p%x,r,y,x,(p-1)/x*w1+w2,((p-1)/x-1)*w1+w2);
	return ~t?t+d*w1+w2:-1;
}
int find(int x,int r,int y,int p)
{x%=p;r%=p;return find1(p-x,p-r-1,p-y-1,p,1,1);}
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%lld %d %d",&n,&a,&b);
		ans=n-n/a-n/b;d=1ll*a/gcd(a,b)*b;
		t=find(a,n%a,n%b,b);
		if(~t) t=t*a+n%a,W(ans,n-n/a-n/b+dv(n-t,d)*2);
		t=find(b,n%b,n%a,a);
		if(~t) t=t*b+n%b,W(ans,n-n/a-n/b+dv(n-t,d)*2);
		t=find(a,0,n%b,b);
		if(~t) t*=a,W(ans,n-n/a-n/b+dv(n-t,d)*2-1);
		t=find(b,0,n%a,a);
		if(~t) t*=b,W(ans,n-n/a-n/b+dv(n-t,d)*2-1);
		t=find(a,n%a,0,b);
		if(~t) t=t*a+n%a,W(ans,n-n/a-n/b+dv(n-t,d)*2-1);
		t=find(b,n%b,0,a);
		if(~t) t=t*b+n%b,W(ans,n-n/a-n/b+dv(n-t,d)*2-1);
		printf("%lld\n",ans);
	}return 0;
}