import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      auto K = new int[M];
      auto C = new long[M];
      auto S = new int[][M];
      foreach (m; 0 .. M) {
        K[m] = readInt();
        C[m] = readLong();
        S[m] = new int[K[m]];
        foreach (k; 0 .. K[m]) {
          S[m][k] = readInt() - 1;
        }
      }
      
      auto mss = new int[][N];
      foreach (m; 0 .. M) {
        foreach (u; S[m]) {
          mss[u] ~= m;
        }
      }
      
      alias Entry = Tuple!(long, "c", int, "u");
      BinaryHeap!(Array!Entry, "a.c > b.c") que;
      auto dist = new long[N + M * 2];
      dist[] = INF;
      que.insert(Entry(dist[0] = 0, 0));
      for (; !que.empty; ) {
        const c = que.front.c;
        const u = que.front.u;
        que.removeFront;
        if (dist[u] == c) {
          void update(int v, long cc) {
            if (chmin(dist[v], cc)) {
              que.insert(Entry(cc, v));
            }
          }
          if (u < N) {
            foreach (m; mss[u]) {
              if ((u + 1) % 2 == 0) {
                update(N + m * 2, c + (u + 1) / 2 + C[m]);
              }
              update(N + m * 2 + 1, c + (u + 1) / 2 + C[m] + 1);
            }
          } else {
            const m = (u - N) / 2;
            const s = (u - N) % 2;
            foreach (v; S[m]) {
              if ((s == 0) ? ((v + 1) % 2 == 0) : true) {
                update(v, c + (v + 1) / 2);
              }
            }
          }
        }
      }
      
      const ans = dist[N - 1];
      writeln((ans >= INF) ? -1 : ans);
    }
  } catch (EOFException e) {
  }
}