#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr)
#define F first
#define S second
#define PB push_back
#define sz(x) ((int)((x).size()))
#define le(vec) vec[vec.size()-1]
#define TSTS int t; cin >> t; while(t--)solve()
const int INF = 1e9;
const long long LINF = 1e18;
const long double PI = asin(1)*2;
const int MOD = 1e9+7;
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef long long ll;
typedef long double ld;
void setIO()
{
FAST_IO;
}
int main()
{
setIO();
int n, k;
cin >> n >> k;
int ans=1;
map<pii, int> cnt;
FOR(i, 0, n)
{
int m;
cin >> m;
FOR(j, 0, m)
{
int x;
cin >> x;
int b=++cnt[{min(i, x), max(i, x)}];
if(b>=2){
cout << 2;
return 0;
}
}
}
cout << ans;
}
