#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
	freopen("csp2022pj_decode.in","r",stdin);
	freopen("csp2022pj_decode.out","w",stdout);
	ull k;
	ull n,e,d;
	cin>>k;
	for(int i=1;i<=k;i++)
	{
		cin>>n>>e>>d;
		ull m=n-e*d+2;//m
		//求x^2-mx+n=0的解
		ll delta=m*m-4*n;
		if(delta<0)
		{
			cout<<"NO"<<endl;
			continue;
		}
		ll sqt=sqrt(delta);
		if(sqt*sqt!=delta)//如果√delta不是整数
		{
			cout<<"NO"<<endl;
			continue;
		}
		ll up1=sqt+m,up2=m-sqt;
		if(up1%2!=0||up2%2!=0||up1<=0||up2<=0)
		{
			cout<<"NO"<<endl;
			continue;
		}
		up1/=2;up2/=2;
		cout<<min(up1,up2)<<" "<<max(up1,up2)<<endl;
	}
	return 0;
}