#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
int main() {
    int k;
    cin >> k;
    while (k--) {
        ll n, e, d;
        cin >> n >> e >> d;
        ll m = n - e * d + 2;
        ll delta = m * m - 4 * n;
        if (delta < 0) {
            cout << "NO\n";
            continue;
        }
        ll root = sqrt(delta);
        if (root * root != delta) {
            cout << "NO\n";
            continue;
        }
        ll p = (m - root) / 2;
        ll q = (m + root) / 2;
        if (p > 0 && q > 0 && p * q == n) {
            cout << p << " " << q << "\n";
        } else {
            cout << "NO\n";
        }
    }
    return 0;
}