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

#define rep(i,n) for(int i=1;i<=n;++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
const int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
bool to[4][21][365];
int n;
int in[21][365][365];
struct POS{
    int x,y,z;
}s,t,q[21*365*365];
int deg(int x,int y){
    return min(abs(x-y),360-abs(x-y));
}
POS fall(POS a){
    for(;;){
        int eve=-1,od=-1;
        if(deg(a.y,a.z)<90)eve=0;
        else if(deg(a.y,a.z)>90)eve=2;
        if(eve!=-1&&!to[eve][a.x][a.y])eve=-1;
        if(deg(a.y,a.z)!=0&&deg(a.y,a.z)!=180){
            if((a.z-a.y+360)%360<180)od=1;else od=3;
        }
        if(od!=-1&&!to[od][a.x][a.y])od=-1;
        if(eve!=-1&&(od==-1||deg(a.y,a.z)<=45||deg(a.y,a.z)>=135)){
            a.x+=dx[eve],a.y=(a.y+dy[eve]+360)%360;
        }else if(od!=-1){
            a.x+=dx[od],a.y=(a.y+dy[od]+360)%360;
        }else break;
    }
    return a;
}
int l,r;
int main() {
    scanf("%d",&n);
    rep(i,n){
        int k;scanf("%d",&k);
        rep(j,k){
            int x,y;scanf("%d%d",&x,&y);
            for(int p=x;p!=y;p=(p+1)%360){
                int q=(p+1)%360;
                to[1][i][p]=1;
                to[3][i][q]=1;
            }
        }
        int l;scanf("%d",&l);
        rep(j,l){
            int x;scanf("%d",&x);
            to[0][i][x]=1;to[2][i+1][x]=1;
        }
    }
    scanf("%d%d%d%d",&s.x,&s.y,&t.x,&t.y),++s.x,++t.x;
    s.z=180;
    s=fall(s);
    in[s.x][s.y][s.z]=1;
    q[1]=s;l=0,r=1;
    while(l<r){
        POS p=q[++l];
        if(p.x==t.x&&p.y==t.y){
            printf("%d\n",in[p.x][p.y][p.z]-1);
            return 0;
        }
        for(int delta:{359,1}){
            POS nxt=fall((POS){p.x,p.y,(p.z+delta)%360});
            if(in[nxt.x][nxt.y][nxt.z]==0){
                in[nxt.x][nxt.y][nxt.z]=in[p.x][p.y][p.z]+1;
                q[++r]=nxt;
            }
        }
    }
    puts("Impossible");
    return 0;
}