// codevs1034#include<algorithm>#include<iostream>#include<cstring>#include<cstdlib>#include<cstdio>#include<cmath>#include<queue>#define LL long long#define inf 2147483640#define Pi acos(-1.0)#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);using namespace std;const int maxn=100010;struct edge {int to,next,w;}e[maxn<<1];int f[100][100],h[100],r[100],es,et,n,m,K,T,cnt=1,ans;int head[maxn],d[maxn];void link(int u,int v,int w) {	e[++cnt]=(edge){v,head[u],w};head[u]=cnt;	e[++cnt]=(edge){u,head[v],0};head[v]=cnt;}void build() {	for (int i=1;i<=m;i++) link(n*(T-1)+f[i][(T-1)%r[i]],n*T+f[i][T%r[i]],h[i]);	for (int i=1;i<=n;i++) link(n*(T-1)+i,n*T+i,inf);	link(n*T+n,et,inf);}bool bfs() {	memset(d,-1,sizeof(d));	queue<int> q;q.push(1);d[1]=0;	while (!q.empty()) {		int x=q.front();q.pop();		for (int i=head[x];i;i=e[i].next) if (e[i].w && d[e[i].to]<0) {				d[e[i].to]=d[x]+1;				q.push(e[i].to);			}	}	return d[et]>0;}int dfs(int x,int f) {	if (x==et || f==0) return f;	int w,used=0;	for (int i=head[x];i;i=e[i].next) if (e[i].w && d[e[i].to]==d[x]+1) {			w=dfs(e[i].to,min(e[i].w,f-used));			used+=w;			e[i].w-=w;e[i^1].w+=w;			if (used==f) return used;		}	if (!used) d[x]=-1;	return used;}void Dinic() {	while (bfs()) K-=dfs(es,inf);}int main() {	scanf("%d%d%d",&n,&m,&K);	es=1;et=100000;	for (int i=1;i<=m;i++) {		scanf("%d%d",&h[i],&r[i]);		for (int j=0;j<r[i];j++) {			scanf("%d",&f[i][j]);			if (++f[i][j]==0) f[i][j]=n+2;		}	}	n+=2;T=0;	link(n,et,inf);	while (++T) {		build();		Dinic();		if (K<=0) break;		if (T>1000) {printf("0");return 0;}	}	printf("%d",T);	return 0;}