#include <bits/stdc++.h>

#define sqr(x) ((x) * (x))
using ll = long long;
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));
}

void solve() {
  ll cx, cy, px, py;
  ll r;
  scanf("%lld%lld%lld%lld%lld", &cx, &cy, &r, &px, &py);

  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", px, 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;

  std::pair<ll, std::pair<ll, ll>> ans(LLONG_MAX, {-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}));
    }
  
  auto [ox, oy] = ans.second;
  assert(ox != -(int)1e9-1 && oy != -(int)1e9-1);
  printf("1\n%lld %lld %lld %lld\n", px, py, ox, oy);
}

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