包AC

#include<bits/stdc++.h>
using namespace std;
int k,n,d,e,m,p,q,ans=1;
int main(){
	cin>>k;
	while(k--){
		cin>>n>>d>>e;
		m=n+2-e*d;
		long long lf=1,rt=m/2;
		bool ok=0;
		while(lf<=rt){
		 p=(lf+rt)/2;
		 q=m-p;		
		 if(p*q>n) rt=p-1;
		 else if(p*q<n) lf=p+1;
		 else {
		 	cout<<p<<" "<<q<<endl;
		 	ok=1;
		 	break;
		 }	
		}
		if(ok==0)cout<<"NO"<<endl;
	} 
	return 0;
}