#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
LL n, d, e;
int k;

int main () {
	freopen("csp2022pj_decode.in", "r", stdin);
	freopen("csp2022pj_decode.out", "w", stdout);
	scanf("%d", &k);
	while (k--) {
		scanf("%lld%lld%lld", &n, &d, &e);
		LL sum = n - d * e + 2;
		if (sum <= 1) {
			printf("NO\n");
			continue;
		}
		else {
			LL l = 1, r = sum / 2;
			while (l < r) {
				LL mid = (l + r) >> 1;
				if (mid * (sum - mid) < n) l = mid + 1;
				else r = mid;
			}
			if (l * (sum - l) == n) printf("%lld %lld\n", l, sum - l);
			else printf("NO\n");
		}
	}
	return 0;
}