#include <bits/stdc++.h>
using namespace std;

using ll=long long;
//#define int ll
using uint=unsigned;
using ull=unsigned ll;

#define gnr(i,a,b)for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define rng(i, a, b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,n) rng(i,0,n)
template<class t>using vc=vector<t>;
template<class t>using vvc=vc<vc<t>>;
using vi=vc<int>;
#define a first
#define b second
#define mp make_pair
using vi=vc<int>;
#define pb push_back
#define eb emplace_back
template<class t,class u>bool chmax(t &a,u b){
	if(a <b){a=b;return true;}
	else return false;
}
template<class t,class u>bool chmin(t &a,u b){
	if(a>b){a=b;return true;}
	else return false;
}

#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())

template<class t>void mkuni(vc<t>&vs){
	sort(all(vs));
	vs.erase(unique(all(vs)),vs.ed);
}
template<class t>int lwb(const vc<t>&vs,t a){
	return lower_bound(all(vs),a)-vs.bg;
}

bool inc(int a,int b,int c){return a<=b&&b<=c;}

const int inf=INT_MAX/2-100;

using pi=pair<int,int>;

const int nmax=21;
const int L=360;
bool go[nmax][L][4];
int dist[nmax][L][L];

void slv(){
	int n;cin>>n;
	rep(i,n){
		{
			int k;cin>>k;
			rep(_,k){
				int x,y;cin>>x>>y;
				x%=L;
				y%=L;
				while(x!=y){
					int z=(x+1)%L;
					go[i][x][2]=true;
					go[i][z][3]=true;
					x=z;
				}
			}
		}
		{
			int k;cin>>k;
			rep(_,k){
				int x;cin>>x;
				x%=L;
				go[i][x][0]=true;
				go[i+1][x][1]=true;
			}
		}
	}
	n++;
	
	rep(i,n)rep(j,L)rep(k,L)dist[i][j][k]=inf;
	
	using Q=tuple<int,int,int,int>;
	deque<Q> q;
	auto reach=[&](int i,int j,int k,int d,bool f){
		if(chmin(dist[i][j][k],d)){
			if(f)q.push_front(Q(i,j,k,d));
			else q.pb(Q(i,j,k,d));
		}
	};
	{
		int i,j;cin>>i>>j;j%=L;
		reach(i,j,0,0,true);
	}
	auto vert=[&](int x){
		return abs(x%L-180);
	};
	int tari,tarj;cin>>tari>>tarj;tarj%=L;
	int ans=inf;
	while(si(q)){
		auto [i,j,k,d]=q.front();q.pop_front();
		if(dist[i][j][k]!=d)continue;
		pi nx(90,-1);
		if(go[i][j][0])chmin(nx,pi(vert(j+k),0));
		if(go[i][j][1])chmin(nx,pi(vert(j+k+180),1));
		if(go[i][j][2])chmin(nx,pi(vert(j+k+90),2));
		if(go[i][j][3])chmin(nx,pi(vert(j+k+270),3));
		if(nx.b==-1){
			//still
			if(i==tari&&j==tarj){
				chmin(ans,d);
			}
			reach(i,j,(k+1)%L,d+1,false);
			reach(i,j,(k+L-1)%L,d+1,false);
		}
		else if(nx.b==0)reach(i+1,j,k,d,true);
		else if(nx.b==1)reach(i-1,j,k,d,true);
		else if(nx.b==2)reach(i,(j+1)%L,k,d,true);
		else if(nx.b==3)reach(i,(j+L-1)%L,k,d,true);
	}
	if(ans>=inf)cout<<"Impossible"<<endl;
	else cout<<ans<<endl;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	slv();
}