#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
constexpr ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define replr(i,l,r) for (ll i=(ll)(l);i<(ll)(r);i++)
#define all(v) v.begin(),v.end()
#define len(v) ((ll)v.size())
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
template<class T> T binary_search(auto f,T ok,T ng){
    while(1<abs(ok-ng)){
        T mid=midpoint(ok,ng);
        if(f(mid)) ok=mid;
        else ng=mid;
    }
    return ok;
}
ll area(ll a,ll b,ll c,ll d){
    ll x=max(a,c),y=max(b,d);
    return x*y*2-(a*b+c*y+(x-c)*(y-b));
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll t;
    cin >> t;
    while(t--){
        ll d,x,y;
        cin >> d >> x >> y;
        ll p=x/gcd(x,y),q=y/gcd(x,y);
        auto f=[&](ll m){
            ll tx=x+m*(-q),ty=y+m*p;
            return 0<=tx&&tx<=d&&0<=ty&&ty<=d;
        };
        auto g=[&](ll m){
            ll tx=x+m*q,ty=y+m*(-p);
            return 0<=tx&&tx<=d&&0<=ty&&ty<=d;
        };
        ll ans=0;
        ll l=binary_search<ll>(f,0,2e9);
        chmax(ans,area(x,y,x+l*(-q),y+l*p));
        ll r=binary_search<ll>(g,0,2e9);
        chmax(ans,area(x+r*q,y+r*(-p),x,y));
        cout << ans << '\n';
    }
}