import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        ArrayList<HashMap<Integer, Integer>> graph = new ArrayList<>();
        for (int i = 0; i < n + m; i++) {
            graph.add(new HashMap<>());
        }
        for (int i = 0; i < m; i++) {
            int k = sc.nextInt();
            int c = sc.nextInt() * 2;
            for (int j = 0; j < k; j++) {
                int x = sc.nextInt() - 1;
                graph.get(x).put(n + i, c + x + 1);
                graph.get(n + i).put(x, x + 1);
            }
        }
        PriorityQueue<Path> queue = new PriorityQueue<>();
        queue.add(new Path(0, 0));
        long[] costs = new long[n + m];
        Arrays.fill(costs, Long.MAX_VALUE);
        while (queue.size() > 0) {
            Path p = queue.poll();
            if (p.idx < n && p.value % 2 == 1) {
                p.value++;
            }
            if (costs[p.idx] <= p.value) {
                continue;
            }
            costs[p.idx] = p.value;
            for (int x : graph.get(p.idx).keySet()) {
                if (costs[x] == Long.MAX_VALUE) {
                    queue.add(new Path(x, p.value + graph.get(p.idx).get(x)));
                }
            }
        }
        if (costs[n - 1] == Long.MAX_VALUE) {
            System.out.println(-1);
        } else {
            System.out.println(costs[n - 1] / 2);
        }
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        long value;
        
        public Path(int idx, long value) {
            this.idx = idx;
            this.value = value;
        }
        
        public int compareTo(Path another) {
            if (value == another.value) {
                return 0;
            } else if (value < another.value) {
                return -1;
            } else {
                return 1;
            }
        }
    }
}

class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}