// ---------- begin scannner ----------
#[allow(dead_code)]
mod scanner {
    use std::str::FromStr;
    pub struct Scanner<'a> {
        it: std::str::SplitWhitespace<'a>,
    }
    impl<'a> Scanner<'a> {
        pub fn new(s: &'a String) -> Scanner<'a> {
            Scanner {
                it: s.split_whitespace(),
            }
        }
        pub fn next<T: FromStr>(&mut self) -> T {
            self.it.next().unwrap().parse::<T>().ok().unwrap()
        }
        pub fn next_bytes(&mut self) -> Vec<u8> {
            self.it.next().unwrap().bytes().collect()
        }
        pub fn next_chars(&mut self) -> Vec<char> {
            self.it.next().unwrap().chars().collect()
        }
        pub fn next_vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
            (0..len).map(|_| self.next()).collect()
        }
    }
}
// ---------- end scannner ----------

use std::io::Write;

fn main() {
    use std::io::Read;
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut sc = scanner::Scanner::new(&s);
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    run(&mut sc, &mut out);
}

fn run<W: Write>(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter<W>) {
    let n: usize = sc.next();
    let m: usize = sc.next();
    let mut g = vec![vec![]; n + 1];
    for _ in 0..m {
        let k: usize = sc.next();
        let c: u64 = sc.next();
        let s: Vec<usize> = sc.next_vec(k);
        let zero = g.len();
        g.push(vec![]);
        let one = g.len();
        g.push(vec![]);
        for &s in s.iter() {
            let d = (s / 2) as u64;
            if s & 1 == 0 {
                g[s].push((zero, c + d));
                g[zero].push((s, d));
                g[one].push((s, d));
            } else {
                g[s].push((one, c + d + 1));
                g[zero].push((s, d + 1));
                g[one].push((s, d));
            }
        }
    }
    use std::cmp::Reverse;
    let inf = std::u64::MAX;
    let mut dp = vec![inf; g.len()];
    dp[1] = 1;
    let mut h = std::collections::BinaryHeap::new();
    h.push(Reverse((0, 1)));
    while let Some(Reverse((d, v))) = h.pop() {
        if d > dp[v] {
            continue;
        }
        for &(u, w) in g[v].iter() {
            let d = d + w;
            if d < dp[u] {
                dp[u] = d;
                h.push(Reverse((d, u)));
            }
        }
    }
    if dp[n] != inf {
        println!("{}", dp[n]);
    } else {
        println!("-1");
    }
}