细菌(disease)

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include <ext/rope>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
#define vi vector<int>
#define pii pair<int,int>
#define mod 1000000007
#define inf 0x3f3f3f3f
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
const int maxn=3e5+10;
const int dis[4][2]={{0,1},{-1,0},{0,-1},{1,0}};
using namespace std;
using namespace __gnu_cxx;
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;}
int n,m,ans[maxn],a[1010],ma;
int work(int p)
{
    int cnt=0;
    while(p){if(p&1)cnt++;p>>=1;}
    return cnt;
}
int main()
{
    int i,j,k,t;
    scanf("%d%d%d",&n,&m,&k);
    rep(i,0,n-1)
    {
        scanf("%d",&j);
        while(j--)
        {
            scanf("%d",&t);
            a[i]+=qpow(2,t-1);
        }
    }
    rep(i,0,qpow(2,m)-1)
    {
        if(work(i)>k)continue;
        rep(j,0,n-1)
        {
            if((i|a[j])==i)ans[i]++;
        }
        ma=max(ma,ans[i]);
    }
    printf("%d\n",ma);
    //system ("pause");
    return 0;
}