#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
ll n,a,b;
ll solve(ll x,ll y,ll z,ll r);
ll evlos(ll x,ll y,ll z,ll r);
ll solve2(ll x,ll y,ll z,ll r){
	ll X=x,Y=y;
	x%=z,y%=z;
	if(x>=r)return x;
	if(!a)return LLONG_MAX;
	x=z-1-x,y=z-y,r=z-1-r;
	int kk=solve(x,y,z,r);
	if(kk==-1)return LLONG_MAX;
	return X+Y*kk;
	
}
void reimu_main(){
	cin>>n>>a>>b;
	ll l=a*b/__gcd(a,b);
	ll ra=n%a,rb=n%b,rl=n%l;
	ll sx=n/a+n/b-n/l*2;
	ll sy=(min(ra,rb)<rl);
	if(solve2(ra,a,b,rb)<rl)sy=2;
	if(solve2(rb,b,a,ra)<rl)sy=2;
	printf("%lld\n",n-sx+sy);
}

int main(){
	int T;cin>>T;
	while(T--)reimu_main();
	return 0;
}
//ll solve(ll x,ll y,ll z,ll r){
//	if(x<=r)return 0;
//	if(!y)return -1;
//	if(2*y>z)return evlos(z-1-x,z-y,z,z-1-r);
//	ll k1=(z-x+y-1)/y,xx=(x+y*k1)%z;
//	ll yy=(y-z%y)%y;
//	ll cs=solve(xx,yy,y,r);
//	if(cs==-1)return -1;
//	ll res=(z+y-1)/y*cs+k1-(xx+cs*yy)/a;
//	return res;
//}
ll solve(ll c,ll a,ll b,ll d){
	if(c<=d)return 0;
	if(a==0)return -1;
	if(2*a>b)return evlos(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=solve(cc,aa,a,d);
	if(cs==-1)return -1;
	int an=(b+a-1)/a*cs+k1-(cc+1ll*aa*cs)/a;
	return an;
}
ll evlos(ll x,ll y,ll z,ll r){
	if(x>=r)return 0;
	if(!y)return -1;
	ll k1=(r-x+y-1)/y,xx=x+y*k1;
	if(xx<z)return k1;
	ll cs=solve(xx-r,y,z,z-r-1);
	if(cs==-1)return -1;
	return cs+k1;
}