#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define FOR(i,n) for(int i=0;i<n;i++)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second

const int MOD = (int)1e9+7;

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 << ")"; }
};

typedef Point<double> P;
struct Polygon{
    vector<P> points;
    Polygon(){}
    void add(P p){
        points.pb(p);
    }

};
double const eps = 1e-7;

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

bool inPolygon(vector<P> &p, P a, bool strict = false) {
	int cnt = 0, n = sz(p);
	rep(i,0,n) {
		P q = p[(i + 1) % n];
		//if (onSegment(p[i], q, a)) return !strict;
		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()
{
    int n,m;
    scanf("%d%d",&n,&m);
    vector<Polygon> A(n);
    FOR(i,n){
        int l; 
        scanf("%d",&l);
        FOR(j,l){
            P p;
            scanf("%lf%lf",&p.x,&p.y);
            A[i].add(p);
        }
    }
    vector<vi> planes(m,vi(6,0));
    FOR(i,m){
        FOR(j,6) cin>>planes[i][j];
    }
    double l = eps, r = M_PI/2-eps;
    double ans = -1;
    while(r-l>=eps){
        double theta = (l+r)/2.0;
        vector<bool> seen(n,false);
        FOR(i,m){
            double l1 = planes[i][2]*tan(theta);
            double l2 = planes[i][5]*tan(theta);
            double xs = planes[i][0]; 
            double xe = planes[i][3];

            double ys = planes[i][1]; 
            double ye = planes[i][4];
            Point dir = P(xe-xs,ye-ys);
            dir = dir.perp();
            dir = dir.unit();
            Point d1 = dir*l1;
            Point d2 = dir*l2;

            P p1(xs,ys), p2(xs,ys), p3(xe,ye), p4(xe,ye);
            p1=p1-d1; p2=p2+d1; p3=p3+d2; p4=p4-d2;
            //cout<<theta<<endl;
            //cout<<p1<<" "<<p2<<" "<<p3<<" "<<p4<<endl;
            vector<P> hull; hull.pb(p1); hull.pb(p2); hull.pb(p3); hull.pb(p4);
            FOR(j,n){
                bool valid = true;
                FOR(k,sz(A[j].points)){
                    if(!inPolygon(hull,A[j].points[k])) valid = false;
                }
                seen[j] = seen[j] || valid;
            }
            //bool inPolygon(vector<P>& p, P a, bool strict = false){
        }
        int cc = 0;
        FOR(i,n) if(seen[i]) cc++;
        if(cc==n){
            r = theta;
            ans = theta;
        }
        else{
            l = theta;
        }
    }
    if(ans<0) printf("impossible\n");
    else{
        //cout<<ans<<endl;
        ans = ans*360/(2*M_PI);
        printf("%.8lf\n",ans);
    }

    return 0;
}