#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
#define rep(i,a,n) for(int i=(a);i<(n);i++)

int T;
int D, x, y;
int main(){
	ios::sync_with_stdio(false);	
	cin.tie(nullptr);

	cin >> T;
	while(T--){
		cin >> D >> x >> y;
		int g = gcd(x, y);
		int nx = y/g, ny = -x/g;
		long l=0L, r=1e9+1;
		while(l+1<r){
			long mid = (l+r)/2;
			long xx = mid*nx+x, yy = mid*ny+y;
			if(0<=xx&&xx<=D&&0<=yy&&yy<=D) l = mid;
			else r = mid;
		}
		long L=-1e9-1, R=0L;
		while(L+1<R){
			long mid = (L+R)/2;
			long xx = mid*nx+x, yy = mid*ny+y;
			if(0<=xx&&xx<=D&&0<=yy&&yy<=D) R = mid;
			else L = mid;
		}
		if(abs(l)>abs(R)) cout << l*(x*x+y*y)/g << endl;
		else cout << -R*(x*x+y*y)/g << endl;
	}
}