#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
	long long k, n, e, d;
	cin>>k;
	while(k--){
		cin>>n>>e>>d;
		int l=1, r=n, s=0;
		while(l<=r){
			long long mid=(l+r)/2;
			if(n-mid-(n/mid)+2==e*d){
			    if(n/mid!=1){
				cout<<n/mid<<" "<<mid<<endl;
				s=1;
				break;
			    }
				else{
					break;
				}
			}
			if(n-mid-(n/mid)+2>e*d){
				l=mid+1;
			}
			if(n-mid-(n/mid)+2<e*d){
				r=mid-1;
			}
		}
		if(s==0)cout<<"NO"<<endl;
	}
	return 0;
}

cspjT2，样例都过不去