#include <bits/stdc++.h>
using namespace std;
const long long inf = 1LL << 55;
struct Point {
  double x, y;
  Point(double x = 0.0, double y = 0.0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double abs() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point& p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point& p) const {
    return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);
  }
};
struct Circle {
  Point c;
  double r;
  Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
};
struct Segment {
  Point p1, p2;
  Segment(Point p1 = Point(), Point p2 = Point()) : p1(p1), p2(p2) {}
};
double norm(Point v) { return v.x * v.x + v.y * v.y; }
double abs(Point v) { return sqrt(norm(v)); }
double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
bool isOrthogonal(Point a, Point b) {
  return (fabs((dot(a, b)) - (0.0)) < (1e-10));
}
bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
  return isOrthogonal(a1 - a2, b1 - b2);
}
bool isOrthogonal(Segment s1, Segment s2) {
  return (fabs((dot(s1.p2 - s1.p1, s2.p2 - s2.p1)) - (0.0)) < (1e-10));
}
bool isParallel(Point a, Point b) {
  return (fabs((cross(a, b)) - (0.0)) < (1e-10));
}
bool isParallel(Point a1, Point a2, Point b1, Point b2) {
  return isParallel(a1 - a2, b1 - b2);
}
bool isParallel(Segment s1, Segment s2) {
  return (fabs((cross(s1.p2 - s1.p1, s2.p2 - s2.p1)) - (0.0)) < (1e-10));
}
Point project(Segment s, Point p) {
  Point base = s.p2 - s.p1;
  double r = dot(p - s.p1, base) / norm(base);
  return s.p1 + base * r;
}
Point reflect(Segment s, Point p) { return p + (project(s, p) - p) * 2.0; }
static const long long COUNTER_CLOCKWISE = 1;
static const long long CLOCKWISE = -1;
static const long long ONLINE_BACK = 2;
static const long long ONLINE_FRONT = -2;
static const long long ON_SEGMENT = 0;
long long ccw(Point p0, Point p1, Point p2) {
  Point a = p1 - p0;
  Point b = p2 - p0;
  if (cross(a, b) > (1e-10)) return COUNTER_CLOCKWISE;
  if (cross(a, b) < -(1e-10)) return CLOCKWISE;
  if (dot(a, b) < -(1e-10)) return ONLINE_BACK;
  if (a.norm() < b.norm()) return ONLINE_FRONT;
  return ON_SEGMENT;
}
bool intersect(Point p1, Point p2, Point p3, Point p4) {
  return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
          ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
bool intersect(Segment s1, Segment s2) {
  return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
double getDistance(Point a, Point b) { return abs(a - b); }
double getDistanceLP(Segment l, Point p) {
  return abs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));
}
double getDistanceSP(Segment s, Point p) {
  if (dot(s.p2 - s.p1, p - s.p1) < 0.0) return abs(p - s.p1);
  if (dot(s.p1 - s.p2, p - s.p2) < 0.0) return abs(p - s.p2);
  return getDistanceLP(s, p);
}
double getDistance(Segment s1, Segment s2) {
  if (intersect(s1, s2)) return 0.0;
  return min(min(getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)),
             min(getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)));
}
Point getCrossPoint(Segment s1, Segment s2) {
  Point base = s2.p2 - s2.p1;
  double d1 = abs(cross(base, s1.p1 - s2.p1));
  double d2 = abs(cross(base, s1.p2 - s2.p1));
  double t = d1 / (d1 + d2);
  return s1.p1 + (s1.p2 - s1.p1) * t;
}
double getDist(vector<Point> a, vector<Point> b) {
  double ret = inf;
  for (long long i = 0; i < 5; i++) {
    for (long long j = 0; j < 5; j++) {
      Segment s1 = Segment(a[i], a[(i + 2) % 5]),
              s2 = Segment(b[j], b[(j + 2) % 5]);
      ret = min(ret, getDistance(s1, s2));
    }
  }
  return ret;
}
signed main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  long long N, M, L;
  while (cin >> N >> M >> L, N) {
    M--, L--;
    vector<vector<Point> > star;
    for (long long i = 0; i < N; i++) {
      Point p, q, base;
      long long a, r;
      cin >> p.x >> p.y >> a >> r;
      q = Point(p.x, p.y + r);
      base = q - p;
      vector<Point> u;
      for (long long i = 0; i < 5; i++) {
        Point r;
        double theta = (a + 72 * i) * M_PI / 180;
        r.x = base.x * cos(theta) - base.y * sin(theta);
        r.y = base.x * sin(theta) + base.y * cos(theta);
        r = r + p;
        u.push_back(r);
      }
      star.push_back(u);
    }
    cout << star.size() << endl;
    double G[101][101];
    for (long long i = 0; i < N; i++) {
      for (long long j = 0; j < N; j++) {
        G[i][j] = (i == j ? 0 : getDist(star[i], star[j]));
      }
    }
    for (long long i = 0; i < N; i++) {
      for (long long j = 0; j < N; j++) {
        for (long long k = 0; k < N; k++)
          G[j][k] = min(G[j][k], G[j][i] + G[i][k]);
      }
    }
    cout << G[M][L] << endl;
  }
  return 0;
}
