#include <bits/stdc++.h>

#define sqr(x) ((x) * (x))
using ll = __int128;
struct Point {
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) { }
};
Point operator + (const Point& a, const Point& b) {
  return Point(a.x + b.x, a.y + b.y);
}
Point operator - (const Point& a, const Point& b) {
  return Point(a.x - b.x, a.y - b.y);
}
double dist(const Point& a, const Point& b) {
  return sqrt(sqr(a.x - b.x) + sqr(a.y - b.y));
}
ll SQRT(ll x) {
  // double t = sqrt(x);
  // if (fabs(t - ceil(t)) < 1e-6) return (ll)ceil(t);
  // if (fabs(t - floor(t)) < 1e-6) return (ll)floor(t);
  // return (ll)floor(t);

  ll lb = 0, ub = 1e18, ans = 0;
  while (lb <= ub) {
    ll mid = (lb + ub) / 2;
    if (mid * mid <= x) ans = mid, ub = mid - 1;
    else lb = mid + 1;
  }

  return ans;
}

ll read() {
  long long x;
  scanf("%lld", &x);
  return x;
}

 
void solve() {
  ll cx = read(), cy = read(), r = read(), px = read(), py = read();

  Point c, p;
  c.x = cx, c.y = cy;
  p.x = px, p.y = py;

  if (sqr(cx - px) + sqr(cy - py) <= sqr(r)) {
    printf("0\n%lld %lld\n", (long long)px, (long long)py);
    return;
  }

  Point d = p - c;
  double ld = dist(p, c);
  // assert(ld > 1e-6);
  d.x /= ld, d.y /= ld;
  d.x *= r, d.y *= r;
  Point o = d + c;
  ll r2 = sqr(r);

  std::pair<ll, std::pair<ll, ll>> ans(ll(1e30), {-1e9 -1, -1e9-1});
  for (int i = -30; i <= 30; i++)
    for (int j = -30; j <= 30; j++) {
      ll ox = (ll)o.x + i, oy = (ll)o.y + j;
      if (sqr(ox - cx) + sqr(oy - cy) > sqr(r)) continue;
      ans = std::min(ans, decltype(ans)(sqr(ox - px) + sqr(oy - py), {ox, oy}));
    }
  
  for (int i = -30; i <= 30; i++) {
    ll ox = (ll)o.x + i;
    if(r2 - sqr(ox-cx)<0) continue;
    ll yyy = SQRT(r2 - sqr(ox-cx));
    ll oy = (ll)c.y - yyy;
    if(sqr(ox - cx) + sqr(oy - cy) <= sqr(r))
      ans = std::min(ans, decltype(ans)(sqr(ox - px) + sqr(oy - py), {ox, oy}));
    oy = (ll)c.y + yyy;
    if (sqr(ox - cx) + sqr(oy - cy) <= sqr(r))
      ans = std::min(ans, decltype(ans)(sqr(ox - px) + sqr(oy - py), {ox, oy}));
  }
  for (int j = -30; j <= 30; j++) {
    ll oy = (ll)o.y + j;
    if(r2 - sqr(oy-cy)<0) continue;
    ll xxx = SQRT(r2 - sqr(oy-cy));

    ll ox = (ll)c.x - xxx;
    if (sqr(ox - cx) + sqr(oy - cy) <= sqr(r))
      ans = std::min(ans, decltype(ans)(sqr(ox - px) + sqr(oy - py), {ox, oy}));
    ox = (ll)c.x + xxx;
    if (sqr(ox - cx) + sqr(oy - cy) <= sqr(r))
      ans = std::min(ans, decltype(ans)(sqr(ox - px) + sqr(oy - py), {ox, oy}));
  }
  
  auto [ox, oy] = ans.second;
  assert(ox != -(int)1e9-1 && oy != -(int)1e9-1);
  printf("1\n%lld %lld %lld %lld\n", (long long)px, (long long)py, (long long)ox, (long long)oy);
}

signed main() {
  int T;
  scanf("%d", &T);
  while (T--) solve();
  return 0;
}
/*
1
0 0 500000000 1000000000 0
*/