#if not LOCAL
#define NDEBUG 1
#endif
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(auto i = a; i < (b); ++i)
#define down(x, a) for (auto x = a; x--;)
#define all(x) begin(x), end(x)
#define sz(x) int(size(x))
#define let auto const

using ll = long long;
using lint = ll;
using pii = pair<int, int>;
using vi = vector<int>;

template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct Point {
	typedef Point P;
	T x, y;
	explicit Point(T x=0, T y=0) : x(x), y(y) {}
	bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
	bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
	P operator+(P p) const { return P(x+p.x, y+p.y); }
	P operator-(P p) const { return P(x-p.x, y-p.y); }
	P operator*(T d) const { return P(x*d, y*d); }
	P operator/(T d) const { return P(x/d, y/d); }
	T dot(P p) const { return x*p.x + y*p.y; }
	T cross(P p) const { return x*p.y - y*p.x; }
	T cross(P a, P b) const { return (a-*this).cross(b-*this); }
	T dist2() const { return x*x + y*y; }
	double dist() const { return sqrt((double)dist2()); }
	// angle to x-axis in interval [-pi, pi]
	double angle() const { return atan2(y, x); }
	P unit() const { return *this/dist(); } // makes dist()=1
	P perp() const { return P(-y, x); } // rotates +90 degrees
	P normal() const { return perp().unit(); }
	// returns point rotated 'a' radians ccw around the origin
	P rotate(double a) const {
		return P(x*cos(a)-y*sin(a),x*sin(a)+y*cos(a)); }
	friend ostream& operator<<(ostream& os, P p) {
		return os << "(" << p.x << "," << p.y << ")"; }
};

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

typedef Point<long double> P;
long double segDist(P& s, P& e, P& p) {
	if (s==e) return (p-s).dist();
	auto d = (e-s).dist2(), t = min(d,max((long double).0,(p-s).dot(e-s)));
	return ((p-s)*d-(e-s)*t).dist()/d;
}

template<class P>
bool inPolygon(vector<P> &p, P a, bool strict = true) {
	int cnt = 0, n = sz(p);
	rep(i,0,n) {
		P q = p[(i + 1) % n];
		if (onSegment(p[i], q, a)) return !strict;
		//or: if (segDist(p[i], q, a) <= eps) return !strict;
		cnt ^= ((a.y<p[i].y) - (a.y<q.y)) * a.cross(p[i], q) > 0;
	}
	return cnt;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);

  int n, m;
  cin>>n>>m;
  vector<vector<pii>> isl(n);
  vector<tuple<int, int, int, int, int, int>> fl(m);
  rep(i, 0, n) {
    int k;
    cin>>k;
    isl[i].resize(k);
    for(auto& [x, y] : isl[i]) cin>>x>>y;
  }
  for(auto& [x1, y1, z1, x2, y2, z2] : fl) {
    cin>>x1>>y1>>z1>>x2>>y2>>z2;
  }

  auto can = [&](long double m) {
    for(auto& is : isl) {
      bool cover = false;
      for(auto& [x1, y1, z1, x2, y2, z2] : fl) {
        if(cover) break;
        bool thiscover = true;
        Point<long double> p1(x1, y1), p2, p3(x2, y2), p4, d;
        d = p3 - p1;
        p2 = p1 - d.normal() * z1 * m;
        p1 = p1 + d.normal() * z1 * m;
        p4 = p3 + d.normal() * z2 * m;
        p3 = p3 - d.normal() * z2 * m;
        vector<Point<long double> > v{p1, p2, p3, p4};
        for(auto [x, y] : is) {
          if(inPolygon(v, Point<long double>(x, y)) == false) {
            thiscover = false;
            break;
          }
        }
        
        if(thiscover) cover = true;
      }
      if(!cover) return false;
    }
    return true;
  };


  long double l = 0, r = 1000000;
  if(!can(r)) {
    cout<<"impossible\n";
    return 0;
  }
  int t = 100;
  while(t--) {
    long double m = (l + r) / 2;
    if(can(m)) r = m;
    else l = m;
  }
  cout<<setprecision(12)<<atan(r) / atan(1) / 4 * 180;
}