#include<bits/stdc++.h>
using namespace std;
int n, d, e;
void pd(){
	cin >> n >> d >> e;
	int m = n - e*d + 2;
	/*p+q=n,pq=m,用韦达定理构建方程:
	x²-mx+n=0  */
	//根的判别式:b²-4ac,只有判别式>=0时有实数根
	//求根公式:-b±√b²-4ac/2a
	int pbs = pow(m,2) - 4*n;
	if(pbs < 0){
		printf("NO\n");
	}
	else if(pbs == 0){
		int sum = m / 2;
		printf("%d %d\n", sum,sum);
	}
	else if(pbs > 0){
		int p,q;
		p = (m+sqrt(pbs))/2;
		q = (m-sqrt(pbs))/2;
		printf("%d %d\n", min(p,q),max(p,q));
	}
}
int main(){
	int t;
	cin >> t;
	while(t--){
		pd();
	}
	return 0;
}