#include <bits/stdc++.h> 
using namespace std;
typedef long long ll;
ll k,n,e,d,m,l,r;
bool f;
int main(){
	freopen("csp2022pj_decode.in","r",stdin);
	freopen("csp2022pj_decode.out","w",stdout);
	cin>>k;
	while(k--){
		f = 1;
		scanf("%lld%lld%lld",&n,&e,&d);
		m = n - (e * d) + 2;
		l = 1,r = m >> 1;
		while(l < r){
			ll mid = (l + r) >> 1;
			ll q = mid * (m - mid);
			if(q == n){
				printf("%lld %lld\n",mid,m-mid);
				f = 0;
				break;
			}
			else if(q > n)r = mid;
			else l = mid+1;
		}
		if(f == 1)printf("NO\n");
	}
	
	return 0;
}