from heapq import *
def dijkstra(g,start):
    n = len(g)
    INF = 1<<61
    dist = [INF]*(n) #startからの最短距離
    dist[start] = 0
    q = [(0,start)] #(そこまでの距離、点)
    while q:
        dv,v = heappop(q)
        if dist[v] < dv: continue
        for to, cost in g[v]:
            if dv + cost < dist[to]:
                dist[to] = dv + cost
                heappush(q, (dist[to], to))
    return dist

n,m = map(int,input().split())
g = [[] for _ in range(1+n+2*m)]
for i in range(m):
    k,c,*a = map(int,input().split())
    O = 2*i + n + 1
    E = 2*i + n + 2
    g[O].append((E,1))
    g[E].append((O,0))
    for ai in a:
        if ai%2:
            g[ai].append((O,ai//2+c))
            g[O].append((ai,ai//2+1))
        else:
            g[ai].append((E,ai//2+c))
            g[E].append((ai,ai//2))

dist = dijkstra(g,1)
print(dist[n] if dist[n] != 1<<61 else -1)