#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
const int N=23,M=371,S=N*M*M,R=360,P=R-1;
struct xy{int x,y;};
inline bool operator<(xy a,xy b){return a.y>b.y;}
vector<xy>q[S];priority_queue<xy>Q;int e[S],d[S],v[S],x,y,z;
inline void add(int x,int y,int z){q[x].push_back({y,z});}
inline void dhjxk(int n,int s){
    f(i,1,n)d[i]=S,v[i]=0;
    for(Q.push({s,d[s]=0});Q.size();){
        x=Q.top().x;Q.pop();
        if(v[x])continue;v[x]=1;
        for(xy e:q[x]){
            y=e.x;z=d[x]+e.y;
            if(z<d[y])Q.push({y,d[y]=z});
        }
    }
}
int dx[5]={0,0,0,1,-1},dy[5]={0,1,-1,0,0};
int b[N][M][M],c[N][M][5],r,sx,sy,tx,ty;
signed main(){
    cin>>n;
    f(i,1,n){
        cin>>m;
        f(_,1,m)for(cin>>l>>r;l!=r;l=(l+1)%R)c[i][l][1]=c[i][(l+1)%R][2]=1;
        cin>>m;
        f(_,1,m)cin>>l,c[i][l][3]=c[i+1][l][4]=1;
    }
    cin>>sx>>sy>>tx>>ty;
    f(x,1,n)f(y,0,P)f(z,0,P)b[x][y][z]=++s;
    f(x,1,n)f(y,0,P)f(z,0,P){
        auto B=b[x][y],C=c[x][y];l=0;
        int d1=(z-y+R)%R,d2=(y-z+R)%R,d=min(d1,d2);
        if(C[3]&&d<=45&&!l)l=3;
        if(C[4]&&d>134&&!l)l=4;
        if(C[1]&&d1<d2&&!l)l=1;
        if(C[2]&&d2<d1&&!l)l=2;
        if(C[3]&&d<90&&!l)l=3;
        if(C[4]&&d>90&&!l)l=4;
        if(e[r=B[z]]=l)add(r,b[x+dx[l]][(y+dy[l]+R)%R][z],0);
        else add(r,B[(z+1)%R],1),add(r,B[(z+P)%R],1);
    }
    dhjxk(s,b[sx+1][sy][180]);l=S;
    f(z,0,P)if(!e[r=b[tx+1][ty][z]])l=min(l,d[r]);
    if(l<S)cout<<l;
    else cout<<"Impossible";
    return 0;
}