#include<bits/stdc++.h>
using namespace std;
struct Point
{
	int x,y;
	Point operator+(const Point&s)const{return {x+s.x,y+s.y};}
	Point operator-(const Point&s)const{return {x-s.x,y-s.y};}
};
long long inner(const Point&A,const Point&B)
{
	return 1ll*A.x*B.x+1ll*A.y*B.y;
}
long long outer(const Point&A,const Point&B)
{
	return 1ll*A.x*B.y-1ll*A.y*B.x; 
}
long long abs2(const Point&A){return 1ll*A.x*A.x+1ll*A.y*A.y;}
struct Line{Point A,B;int rA,rB;};
double dis(const Line&L,const Point&O)
{
	const Point&A=L.A;
	const Point&B=L.B;
	int rA=L.rA,rB=L.rB;
	if(inner(O-B,A-B)<0||inner(O-A,B-A)<0)return 1e100;
	long long len=abs2(B-A);
	return abs(outer(O-A,O-B))/sqrt(len)/(rB+(double)inner(O-B,A-B)/len*(rA-rB));
}
vector<Point>A[110];
Line B[110];
int n,m;
int main()
{
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>m;
	for(int i=1;i<=n;++i)
	{
		int t;cin>>t;
		while(t--)
		{
			int x,y;cin>>x>>y;
			A[i].push_back({x,y});
		} 
	}
	for(int j=1;j<=m;++j)cin>>B[j].A.x>>B[j].A.y>>B[j].rA>>B[j].B.x>>B[j].B.y>>B[j].rB;
	double ans=0;
	for(int i=1;i<=n;++i)
	{
		double mn=1e100,mx;
		for(int j=1;j<=m;++j)
		{
			mx=0;for(auto k:A[i])
				mx=max(mx,dis(B[j],k));
			mn=min(mn,mx);
		}
		if(mn>=1e100)return puts("impossible"),0;
		ans=max(ans,mn);
	}
	printf("%.9lf\n",atan(ans)/acos(-1.0)*180);
 }