#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

struct P {
  double x, y;
  
  explicit P(double x_ = 0, double y_ = 0) : x(x_), y(y_) {}
  P operator-(P p) const { return P(x - p.x, y - p.y); }
  double dot(P p) const { return x * p.x + y * p.y; }
  double cross(P p) const { return x * p.y - y * p.x; }
  double cross(P a, P b) const { return (a - *this).cross(b - *this); }
};

template<class P> bool onSegment(P s, P e, P p) {
	return abs(p.cross(s, e)) < 1e-9 && (s - p).dot(e - p) <= 0;
}

bool InPolygon(vector<P>& p, P a) {
  int n = p.size();
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    P q = p[(i + 1) % n];
    if (onSegment(p[i], q, a)) return true;
    cnt ^= ((a.y < p[i].y) - (a.y < q.y)) * a.cross(p[i], q) > 0;
  }
  return cnt;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<vector<P>> sets(n);
  for (auto& v : sets) {
    int k;
    cin >> k;
    v.resize(k);
    for (P& p : v) {
      cin >> p.x >> p.y;
    }
  }
  vector<int> x1(m), y1(m), z1(m), x2(m), y2(m), z2(m);
  for (int i = 0; i < m; i++) {
    cin >> x1[i] >> y1[i] >> z1[i];
    cin >> x2[i] >> y2[i] >> z2[i];
  }
  
  const double pi = acosl(-1);
  
  auto Works = [&](double theta) -> bool {
    vector<int> ok(n, false);
    for (int i = 0; i < m; i++) {
      double dx = x2[i] - x1[i];
      double dy = y2[i] - y1[i];
      double norm = hypot(dx, dy);
      dx /= norm;
      dy /= norm;
      double len1 = z1[i] * tan(theta / 180 * pi);
      P p1r(x1[i] + dy * len1, y1[i] - dx * len1);
      P p1l(x1[i] - dy * len1, y1[i] + dx * len1);
      double len2 = z2[i] * tan(theta / 180 * pi);
      P p2r(x2[i] + dy * len2, y2[i] - dx * len2);
      P p2l(x2[i] - dy * len2, y2[i] + dx * len2);
      vector<P> quad = {p1l, p1r, p2r, p2l};
      for (int j = 0; j < n; j++) {
        bool all = [&] {
          for (P& p : sets[j]) {
            if (!InPolygon(quad, p)) {
              return false;
            }
          }
          return true;
        }();
        if (all) {
          ok[j] = true;
        }
      }
    }
    return ranges::count(ok, true) == n;
  };

  double low = 0.0, high = 90.0 - 1e-7;
  for (int it = 0; it < 100; it++) {
    double mid = (low + high) / 2;
    if (Works(mid)) {
      high = mid;
    } else {
      low = mid;
    }
  }
  if (low > 90.0 - 1e-6) {
    cout << "impossible\n";
  } else {
    cout.precision(10);
    cout << fixed;
    cout << low << '\n';
  }
  return 0;
}