#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fir first
#define sec second
#define MP make_pair
#define templ template<typename T>
templ bool chkmin(T &x,T y){return x>y?x=y,1:0;}
templ bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;

pll solve(ll a,ll b,ll A,ll B) {
    if (a<b) {
        pll ans=solve(b,a,B,A);
        return {ans.sec,ans.fir};
    }
    ll t=A/b*b;
    a-=t,A-=t;
    if (a>=b) return {t+max(A,B),max(A,B)};
    pll ans=solve(a,b,A,B);
    return {ans.fir+t,ans.sec};
}

// ll inv()

// void work(ll a,ll b,ll xa,ll xb) {
//     ll g=__gcd(a,b);
//     assert(xa%g==xb%g);
//     ll t=xa%g;
//     a/=g,b/=g,xa/=g,xb/=g;
//     ll mod=a*b;
//     return t+((__int128)xa*b%mod*inv(b,a)+(__int128)xb*a%mod*inv(a,b))%(a*b)*g;
// }
ll lcm(ll x,ll y){return x/__gcd(x,y)*y;}
void exgcd(ll a,ll b,ll &x,ll &y) {
    if (!b) return x=1,y=0,void();
    exgcd(b,a%b,y,x),y-=a/b*x;
}
ll exCRT(ll a1,ll p1,ll a2,ll p2) {
    ll a,b,gcd=__gcd(p1,p2);
    if ((a1-a2)%gcd) assert(0);
    exgcd(p1,p2,a,b);
    ll k=__int128((a2-a1)%p2+p2)*(a+p2)%p2;
    return p1/gcd*k+a1;
}

void work() {
    ll n,a,b; cin>>n>>a>>b;
    if (n%a==0&&n%b==0) {
        cout<<n-n/a-n/b+2*n/lcm(a,b)<<'\n';
        return;
    }
    ll A=n%a,B=n%b;
    pll w=solve(a,b,A,B);
    ll m=exCRT(w.fir,a,w.sec,b);
    if (m<n%lcm(a,b)) {
        cout<<n-n/a-n/b+2*(n/lcm(a,b)+1)<<'\n';
        return;
    }
    ll ans=n-n/a-n/b+2*(n/lcm(a,b)+1)-1-1;
    ll t=n%lcm(a,b)-1;
    if (t>=n%a||t>=n%b) ++ans;
    cout<<ans<<'\n';
}

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    int T; cin>>T;
    while (T--) work();
    return 0;
}