for( i = 1 ; i <= n ; i++)
            for (j = 1 ; j <= n ; j++)
                map[i][j] = infi ;
        for(i = 1 ; i <= n ; i++)
        {
            scanf ("%d%d%d", &p[i] , &rank[i] , &x) ;
            {
                while (x--)
                {
                    scanf ("%d%d" , &a , &b) ;
                    map[i][a] = b ;
                }
            }
        }
        int solv = infi ;
        for (i = rank[1] - m ; i <= rank[1] ; i++)
        {
            dijkstra (i , i + m) ;
            for (j = 1 ; j <= n ; j++)
                solv = min (solv , p[j] + d[j]);
        }
        printf ("%d\n" , solv) ;