poj2139 //呵呵呵呵呵呵呵呵呵呵呵呵呵呵呵呵呵呵呵

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
#define maxx 0x100000


int d[301],cost[301][301],n,m,jj,a,b,c[301];


int main(){
while(cin>>n>>m){
for(int i = 1;i<=n;++i){
for(int j = 1;j<=n;++j){
cost[i][j] = maxx;
}
}
fill(d,d+n+1,0);
for(int i = 1;i<=m;++i){
cin>>jj;
for(int j = 1;j<=jj;++j)
cin>>c[j];
for(int j = 1;j<=jj;++j){
for(int k = j+1;k<=jj;++k){
cost[c[j]][c[k]] = 100;
cost[c[k]][c[j]] = 100;
}
}
}
for(int k = 1;k<=n;++k){
for(int i = 1;i<=n;++i){
for(int j = 1;j<=n;++j){
cost[i][j] = min(cost[i][j],cost[i][k] + cost[k][j]);
}
}
}
for(int i = 1;i<=n;++i){
for(int j = 1;j<=n;++j){
if(j == i)
continue;
d[i] += cost[i][j];
}
}
sort(d+1,d+1+n);
cout<<d[1]/(n-1)<<endl;
}
return 0;
}