#include<iostream>
#include<vector>
#include<queue>
using namespace std;
int N,M;
vector<pair<int,int> >G[5<<17];
long dist[5<<17];
main()
{
	cin>>N>>M;
	for(int i=0;i<M;i++)
	{
		int k,c;cin>>k>>c;
		c++;
		for(int j=0;j<k;j++)
		{
			int s;cin>>s;
			s--;
			G[s].push_back(make_pair(N+i*4+s%2,s/2));
			G[N+i*4+2+s%2].push_back(make_pair(s,s/2));
		}
		G[N+i*4].push_back(make_pair(N+i*4+2,c));
		G[N+i*4].push_back(make_pair(N+i*4+3,c+1));
		G[N+i*4+1].push_back(make_pair(N+i*4+2,c+1));
		G[N+i*4+1].push_back(make_pair(N+i*4+3,c+1));
	}
	for(int i=0;i<N+4*M;i++)dist[i]=9e18;
	priority_queue<pair<long,int> >P;
	dist[0]=0;
	P.push(make_pair(0,0));
	while(!P.empty())
	{
		int u=P.top().second;
		long c=-P.top().first;
		P.pop();
		if(dist[u]<c)continue;
		for(pair<int,int>e:G[u])
		{
			int v=e.first;
			long nxt=c+e.second;
			if(dist[v]>nxt)
			{
				dist[v]=nxt;
				P.push(make_pair(-nxt,v));
			}
		}
	}
	long ans=dist[N-1];
	if(ans==(long)9e18)ans=-1;
	cout<<ans<<endl;
}