#include <bits/stdc++.h>

using namespace std;

const int N = 105;

vector< pair<int, int> > p[N];
int n, m, _a[N], _b[N], _c[N], _d[N], _e[N], _f[N];

double calc(int x, int y, int id)
{
    double t = -atan2(_e[id] - _b[id], _d[id] - _a[id]);
    double ta = _a[id] * cos(t) - _b[id] * sin(t), tb = _a[id] * sin(t) + _b[id] * cos(t), tc = _c[id];
    double td = _d[id] * cos(t) - _e[id] * sin(t), te = _d[id] * sin(t) + _e[id] * cos(t), tf = _f[id];
    if (ta > td) {
        swap(ta, td), swap(tb, te), swap(tc, tf);
    }
    double tx = x * cos(t) - y * sin(t), ty = x * sin(t) + y * cos(t);
    tx -= ta, ty -= tb;
    td -= ta, te -= tb;
    if (tx < -1e-8 || tx > td + 1e-8) {
        return 1e9;
    }
    double va = tc * (td - tx) / td + tf * tx / td;
    double p = va, q = fabs(ty), r = atan(q / p);
    return r / acos(-1.0) * 180;
}

signed main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) {
        int z;
        scanf("%d", &z);
        while (z--) {
            int x, y;
            scanf("%d%d", &x, &y);
            p[i].push_back(make_pair(x, y));
        }
    }
    for (int i = 1; i <= m; ++i) {
        scanf("%d%d%d%d%d%d", &_a[i], &_b[i], &_c[i], &_d[i], &_e[i], &_f[i]);
    }
    double res = 0;
    for (int i = 1; i <= n; ++i) {
        double mn = 1e9;
        for (int j = 1; j <= m; ++j) {
            double mx = 0;
            for (int k = 0; k < (int)p[i].size() && mx < 1e8; ++k) {
                mx = max(mx, calc(p[i][k].first, p[i][k].second, j));
            }
            mn = min(mn, mx);
        }
        if (mn > 1e8) {
            puts("impossible");
            return 0;
        }
        res = max(res, mn);
    }
    printf("%.10lf\n", res);
    return 0;
}