#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const double EPS = 1e-6;
const double INF = 1e12;
typedef complex<double> P;
namespace std {
bool operator<(const P &a, const P &b) {
  return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
}
bool sorty(const P &a, const P &b) {
  return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);
}
bool same(const P &a, const P &b) {
  P p = a - b;
  if (abs(real(p)) < EPS && abs(imag(p)) < EPS) {
    return true;
  }
  return false;
}
}  // namespace std
double cross(const P &a, const P &b) { return imag(conj(a) * b); }
double dot(const P &a, const P &b) { return real(conj(a) * b); }
class L {
 public:
  vector<P> l;
  P v;
  L(){};
  L(const P &a, const P &b) {
    l.push_back(a);
    l.push_back(b);
    v = (b - a);
  }
  L(double a, double b, double c, double d) {
    l.push_back(P(a, b)), l.push_back(P(c, d));
  }
  P &operator[](const int i) { return l[i]; }
  void readL() {
    double a, b, c, d;
    cin >> a >> b >> c >> d;
    l.clear();
    l.push_back(P(a, b)), l.push_back(P(c, d));
  }
};
int ccw(P a, P b, P c) {
  b -= a;
  c -= a;
  if (cross(b, c) > 0) return +1;
  if (cross(b, c) < 0) return -1;
  if (dot(b, c) < 0) return +2;
  if (norm(b) < norm(c)) return -2;
  return 0;
}
int linejudge(L &ab, L &cd) {
  P a = ab[1] - ab[0], b = cd[1] - cd[0];
  if (abs(cross(a, b)) < EPS) {
    return 2;
  } else if (abs(dot(a, b)) < EPS) {
    return 1;
  }
  return 0;
}
bool intersectLL(L &l, L &m) {
  return abs(cross(l[1] - l[0], m[1] - m[0])) > EPS ||
         abs(cross(l[1] - l[0], m[0] - l[0])) < EPS;
}
bool intersectLS(L &l, L &s) {
  return cross(l[1] - l[0], s[0] - l[0]) * cross(l[1] - l[0], s[1] - l[0]) <
         EPS;
}
bool intersectLP(L &l, P &p) { return abs(cross(l[1] - p, l[0] - p)) < EPS; }
bool intersectSS(L &s, L &t) {
  return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&
         ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;
}
bool intersectSP(L &s, P &p) {
  return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS;
}
P projection(L &l, P &p) {
  double t = dot(p - l[0], l[0] - l[1]) / norm(l[0] - l[1]);
  return l[0] + t * (l[0] - l[1]);
}
P reflection(L &l, P &p) { return p + 2.0 * (projection(l, p) - p); }
double distanceLP(L &l, P &p) { return abs(p - projection(l, p)); }
double distanceLL(L &l, L &m) {
  return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);
}
double distanceLS(L &l, L &s) {
  if (intersectLS(l, s)) return 0;
  return min(distanceLP(l, s[0]), distanceLP(l, s[1]));
}
double distanceSP(L &s, P &p) {
  P r = projection(s, p);
  if (intersectSP(s, r)) return abs(r - p);
  return min(abs(s[0] - p), abs(s[1] - p));
}
double distanceSS(L &s, L &t) {
  if (intersectSS(s, t)) return 0;
  return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),
             min(distanceSP(t, s[0]), distanceSP(t, s[1])));
}
double distancePP(P &p, P &q) { return abs(p - q); }
P crosspoint(L &l, L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  if (abs(A) < EPS && abs(B) < EPS) return m[0];
  if (abs(A) < EPS) assert(false);
  return m[0] + B / A * (m[1] - m[0]);
}
P crosspointSS(L &l1, L &l2) {
  double d1 = abs(cross(l2.v, l1[0] - l2[0]));
  double d2 = abs(cross(l2.v, l1[1] - l2[0]));
  double t = d1 / (d1 + d2);
  return l1[0] + t * l1.v;
}
P verticalvector(P &a, P &b) {
  if (a.real() == b.real()) {
    return {1.0, 0};
  }
  if (a.imag() == b.imag()) {
    return {0, 1.0};
  }
  P p = a - b;
  P res = {-p.imag(), p.real()};
  return res / abs(p);
}
const double PI = acos(-1);
double d2r(int d) { return (1.0 * d / 180) * PI; }
class star {
 public:
  P p[5], c;
  L l[5];
  star(){};
  star(double x, double y, int a, double r) {
    int d = a + 90;
    c = P(x, y);
    for (int i = 0; i < (int)(5); ++i) {
      p[i] = c + polar(r, d2r(d));
      d += 72;
    }
    for (int i = 0; i < (int)(5); ++i) {
      l[i] = L(p[i], p[(i + 2) % 5]);
    }
  }
  P &operator[](int i) { return p[i]; }
  bool operator<(const star &s) const { return c < s.c; }
  void show() {
    for (int i = 0; i < (int)(5); ++i) {
      cout << p[i] << endl;
    }
    cout << endl;
  }
};
double distanceStar(star &s, star &t) {
  double res = INF;
  for (int i = 0; i < (int)(5); ++i) {
    for (int j = 0; j < (int)(5); ++j) {
      if (same(s[i], t[j]) || intersectSS(s.l[i], t.l[j]) ||
          intersectSP(s.l[i], t[j]) || intersectSP(t.l[i], s[j])) {
        return 0;
      } else {
        res = min(res, distancePP(s[i], t[j]));
        res = min(res, distanceSP(s.l[i], t[j]));
        res = min(res, distanceSP(t.l[i], s[j]));
        res = min(res, distanceSS(s.l[i], t.l[j]));
      }
    }
  }
  return res;
}
double dis[101][101];
double ans[101][101];
void warshall(int n) {
  for (int i = 0; i < (int)(n); ++i) {
    for (int j = 0; j < (int)(n); ++j) {
      ans[i][j] = INF;
    }
  }
  for (int k = 0; k < (int)(n); ++k) {
    for (int i = 0; i < (int)(n); ++i) {
      for (int j = 0; j < (int)(n); ++j) {
        ans[i][j] = min(ans[i][j], dis[i][k] + dis[k][j]);
      }
    }
  }
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, m, l;
  while (cin >> n >> m >> l, n + m + l) {
    --l, --m;
    vector<pair<star, int>> vs(n);
    double x, y, b, r;
    for (int i = 0; i < (int)(n); ++i) {
      cin >> x >> y >> b >> r;
      vs[i] = make_pair(star(x, y, b, r), i);
    }
    for (int i = (0); i < (int)(n); ++i) {
      for (int j = 0; j < (int)(n); ++j) {
        dis[i][j] = distanceStar(vs[i].first, vs[j].first);
      }
    }
    warshall(n);
    cout << fixed << setprecision((10)) << ans[l][m] << endl;
  }
  return 0;
}
