package 洛谷.csp_j;
import java.util.*;
public class P8814 {
    public static void main(String[] args) {
        Scanner scan=new Scanner(System.in);
        int k=scan.nextInt();
        long[] n=new long[k];
        long[] d=new long[k];
        long[] e=new long[k];
        double[] ans1=new double[k];
        double[] ans2=new double[k];
        double b,c;
        for (int i = 0; i < k; i++) {
            n[i]=scan.nextLong();
            d[i]=scan.nextLong();
            e[i]=scan.nextLong();  
            
            b=-(n[i]+2-d[i]*e[i]);
            c=n[i];
            if(b*b-4*c>=0){
                ans1[i]=(-b+Math.sqrt(b*b-4*c))/2;
                ans2[i]=n[i]+2-d[i]*e[i]-ans1[i];
            }           
        }
        for (int j = 0; j < k; j++) {
             if((int)ans1[j]==ans1[j]&&ans2[j]==(int)ans2[j]&&(long)Math.min(ans1[j],ans2[j])!=0&&(long)Math.max(ans1[j],ans2[j])!=0){
            System.out.println((long)Math.min(ans1[j],ans2[j])+" "+(long)Math.max(ans1[j],ans2[j]));
             }else{
            System.out.println("NO");
             }
        }
        scan.close();
    }
}