#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
    int k;
    cin>>k;
    long long int n[100001], e[100001], d[100001], p[100001], q[100001];
    long long int p_q=0;
    for(int i=0;i<k;i++)
    {
        cin>>n[i]>>e[i]>>d[i];
        p[i]=0;
        q[i]=0;
        p_q=-1*(e[i]*d[i]-n[i]-2);
        bool flag=0;
        long long int t=0;
        for(long long int j=1;j<=p_q;j++)
        {
            t=p_q-j;
            if(t*j==n[i])
            {
                p[i]=j;
                q[i]=t;
                flag=1;
                break;
            }
        }
        if(flag)
            cout<<min(p[i],q[i])<<" "<<max(p[i],q[i])<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}