#include<bits/stdc++.h>
using namespace std;
using ll = long long;
bool isCompletelySquare(ll n, ll &sqrt_n) {
    if (n < 0) return false;
    ll root = (ll)sqrtl(n);
    if (root * root == n) {
        sqrt_n = root;
        return true;
    }
    return false;
}

int main() {
    int k;
    cin >> k;
    while (k--) {
		ll n, d, e;
	    cin >> n >> d >> e;
	    ll s = n + 2 - e * d;
	    if (s < 2) {
	        cout << "NO\n";
	        return 0;
	    }
	    ll discriminant = s * s - 4 * n;
	    if (discriminant < 0) {
	        cout << "NO\n";
	        return 0;
	    }
	    ll sqrt_delta;
	    if (!isCompletelySquare(discriminant, sqrt_delta)) {
	        cout << "NO\n";
	        return 0;
	    }
	    if ((s + sqrt_delta) % 2 != 0 || (s - sqrt_delta) % 2 != 0) {
	        cout << "NO\n";
	        return 0;
	    }
	    ll p = (s - sqrt_delta) / 2;
	    ll q = (s + sqrt_delta) / 2;
	    if (p > 0 && q > 0 && p * q == n) {
	        cout << p << " " << q << "\n";
	    } else {
	        cout << "NO\n";
	    }
    }
}