#include<bits/stdc++.h>
using namespace std ;
long long T , n , e , d , m ; 
int main( ) {
	scanf( "%d" , &T ) ;
	while ( T-- ) {
		scanf( "%d %d %d" , &n , &e , &d ) ;
		m = n - e * d + 2 ;
		long long l = 1 , r = sqrt( n ) ;
		while ( l + 1 < r ) {
			long long mid = ( l + r ) >> 1 ;
			if ( mid * ( m - mid ) <= n ) {
				l = mid ;
			}		
			else {
				r = mid - 1 ;
			}
		}
		if ( l * ( m - l ) == n ) {
			printf( "%d %d\n" , l , ( m - l ) ) ;
		}
		else {
			printf( "NO\n" ) ;
		}
	}
	return 0 ;
}