#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;

typedef long long l;

int main()
{
    l k;
    scanf("%lld", &k);
    for (l i = 1; i <= k; ++i)
    {
        l n, e, d;
        scanf("%lld%lld%lld", &n, &e, &d);
        l x = n - e * d + 2;
        l y = pow(x, 2) - 4 * n;
        if (pow((l)(sqrt(y)), 2) == y)
        {
            l p = (x + sqrt(y)) / 2;
            l q = x - p;
            if (p * q == n && e * d == (p - 1) * (q - 1) + 1)
            {
                printf("%lld %lld\n", q, p);
                continue;
            }
        }
        printf("NO\n");
    }
    return 0;
}

悬赏关注！！！