#include <bits/stdc++.h>
using namespace std;
#define y0 yyy0
typedef long long ll;
#define sz(x) (int)(x.size())
#define out(x) cerr << #x << " = " << x << " "
#define outln(x) cerr << #x << " = " << x << endl

const ll inf = 10000000000ll;
ll xc, yc, r, x0, y0;
ll s2(ll x) {return x * x;}

int main() {
	int t; scanf("%d", &t); while (t--) {
		scanf("%lld%lld%lld%lld%lld", &xc, &yc, &r, &x0, &y0);
		x0 -= xc, y0 -= yc;
		if (x0 * x0 + y0 * y0 <= r * r) {
			printf("0\n%lld %lld\n", x0 + xc, y0 + yc);
			continue;
		}
		ll ansx = 0ll, ansy = 0ll, dis = s2(x0) + s2(y0);
		if (x0 == 0) {
			if (y0 >= 0) ansx = x0, ansy = r;
			else ansx = x0, ansy = -r;
		} else if (y0 == 0) {
			if (x0 >= 0) ansx = r, ansy = y0;
			else ansx = -r, ansy = y0;
		} else {
			double D = sqrt(x0 * x0 + y0 * y0);
			double xx0 = r / D * x0, yy0 = r / D * y0;
			ll px = (ll)xx0, py = (ll)yy0;
			const int K = 3000;
			for (int i = -K; i <= K; ++i) {
				for (int j = -K; j <= K; ++j) {
					ll qx = px + i, qy = py + j;
					if (qx * qx + qy * qy <= r * r) {
						ll len = s2(qx - x0) + s2(qy - y0);
						if (len < dis) {
							dis = len;
							ansx = qx, ansy = qy;
						}
					}
				}
			}
			const int L = 1500;
			for (int i = -L; i <= L; ++i) {
				for (int j = -L; j <= L; ++j) {
					ll qx = i, qy = j;
					if (qx * qx + qy * qy <= r * r) {
						ll len = s2(qx - x0) + s2(qy - y0);
						if (len < dis) {
							dis = len;
							ansx = qx, ansy = qy;
						}
					}
				}
			}
		}
		x0 += xc, y0 += yc;
		ansx += xc, ansy += yc;
		printf("1\n%lld %lld %lld %lld\n", x0, y0, ansx, ansy); 
	}
	return 0;
}