#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
ll n,e,d;
bool work(){
	cin>>n>>e>>d;
	ll p_add_q=n-e*d+2;
	ll p_sub_q_2=(p_add_q*p_add_q)-(4*n);
	if(p_sub_q_2<0) return false;
	ll p_sub_q=sqrt(p_sub_q_2);
	if(p_sub_q*p_sub_q!=p_sub_q_2) return false;
	ll p=(p_sub_q+p_add_q)/2;
	ll q=p_sub_q/2-p;
	if(p*q>n) return false;
	if(p>q) swap(p,q);
	cout<<p<<" "<<q<<endl;
	return true;
}
int main(){
	int t;
	cin>>t;
	for(int i=1;i<=t;i++)
		if(!work()){
			cout<<"NO"<<endl;
		}
	return 0;
}