#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() 
{
    int k;
    cin>>k;
    for(int i=0;i<k;i++) 
	{
        ll n,d,e;
        cin>>n>>d>>e;
        ll m=n-e*d+2;
        ll l=1, r=n;
        bool b=0;
        while (l<r) 
		{
            ll mid=l+(r-l)/2;
            if (mid*(n/mid)==n&&mid+(n/mid)==m) 
			{
                cout<<min(mid,n / mid)<<" "<<max(mid,n / mid)<<endl;
                b=1;
                break;
            } 
			else
			{
				if(mid+(n/mid)<m) 
			    {
                    l=mid+1;
                } 
				else 
				{
                    r=mid;
                }
			} 
        }
        if (!b)
            cout<<"NO"<<endl;
    }
    return 0;
}