#include<bits/stdc++.h>
using namespace std;
struct node
{
	int n,e,d,a;
}k[100001];
int mj(int n)
{
	int p,q;
	p=1;
	for(;;p++)
	{
		q=k[n].a-p;
		if(p*q==k[n].n&&(p-1)*(q-1)+1==k[n].e*k[n].d)
		return p;
		if(p>q)
		break;
	}
	return -1;
}
int main ()
{
    freopen("csp2022pj_decode.in","r",stdin);
    freopen("csp2022pj_decode.out","w",stdout);
    int p,q,x;
    cin>>x;
    for(int i=1;i<=x;i++)
    {
    	cin>>k[i].n>>k[i].e>>k[i].d;
    	k[i].a=k[i].n-k[i].e*k[i].d+2;
	}
	for(int i=1;i<=x;i++)
	{
		p=mj(i);
		if(p==-1)
		{
			cout<<"NO";
		}
		else
		{
			cout<<p<<" "<<k[i].a-p;
		}
		cout<<endl;
	}
}