#include #include using namespace std; typedef long long ll; const int INF = 1<<30; const ll INFLL = 1LL<<60; const ll MOD = 998244353; const double INFD = 1.0E10; const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1}; const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1}; using Pair = pair; using Graph = vector>; using mint = atcoder::modint998244353; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); int t; cin >> t; while (t--){ ll d, x, y; cin >> d >> x >> y; ll g = gcd(x, y); ll p = y / g, q = x / g; //(-p, q) ll n = 0; if (p == 0) n = max((d - y) / q, y / q); else if (q == 0) n = max(x / p, (d - x) / p); else n = max(min(x / p, (d - y) / q), min((d - x) / p, y / q)); //cout << g << ' ' << n << ' '; cout << (g * n) * (p * p + q * q) << '\n'; } return 0; }