代码：

#include<bits/stdc++.h>
using namespace std;
int k;
long long n,e,d;
int main()
{
	scanf("%d",&k);
	for(int i=1;i<=k;i++){
		scanf("%lld %lld %lld",&n,&e,&d);
		long long PpusQ=n-e*d+2;
		long long PsubQ=sqrt(PpusQ*PpusQ-4*n);
		long long P=(PpusQ+PsubQ)/2;
		long long Q=PpusQ-P;
		if(n==P*Q&&e*d==(P-1)*(Q-1)+1&&P&&Q)
			printf("%lld %lld\n",min(P,Q),max(P,Q));
		else printf("No\n");
		
	}
	return 0;
}