//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T>>;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head



int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vvi G(n);
  vvi s(m);
  vi k(m);
  vi c(m);
  rep(i, m) {
    cin >> k[i];
    s[i].resize(k[i]);
    cin >> c[i];
    rep(j, k[i]) {
      cin >> s[i][j];
      G[--s[i][j]].emplace_back(i);
    }
  }
  vector<ll> dist(n, LINF);
  dist[0] = 0;
  PQG<pair<ll, int>> q;
  q.emplace(0, 0);
  while(not q.empty()) {
    auto [d, now] = q.top();
    q.pop();
    if(d != dist[now]) continue;
    for(auto to:G[now]) {
      if(k[to] == -1) continue;
      for(auto ne:s[to]) {
        if(chmin(dist[ne], d+c[to]+(ne+now+1)/2+1)) {
          q.emplace(dist[ne], ne);
        }
      }
      k[to] = -1;
    }
  }
  if(dist[n-1] == LINF) puts("-1");
  else cout << dist[n-1] << endl;
}