ACcode:
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
ull n,k,a[22],ans;
void dfs(ull pos,ull sum){
if(pos>n){
ans=max(ans,sum);
return;
}
dfs(pos+1,sum^a[pos]);
dfs(pos+1,sum);
}
void solve(){
cin>>n>>k;
for(ull i=1;i<=n;i++){
ull c;
cin>>c;
for(ull j=1;j<=c;j++){
ull x;
cin>>x;
a[i]|=(1ull<<(k-x));
}
}
dfs(0,0);
cout<<ans<<"\n";
}
int main(){
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
solve();
return 0;
}
over~