#include<bits/stdc++.h>
#define INF LLONG_MAX/2
#define N 10005
using namespace std;typedef struct
{int to,next;long long flow;
}ss;ss edg[N*4];
int now_edge=0,s,t;
int head[N];void addedge(int u,int v,long long flow)
{edg[now_edge]=(ss){v,head[u],flow};head[u]=now_edge++;edg[now_edge]=(ss){u,head[v],0};head[v]=now_edge++;
}int dis[N];bool bfs()
{memset(dis,0,sizeof(dis));queue<int>q;q.push(s);dis[s]=1;while(!q.empty()){int now=q.front();q.pop();for(int i=head[now];i!=-1;i=edg[i].next){ss &e=edg[i];if(e.flow>0&&dis[e.to]==0){dis[e.to]=dis[now]+1;q.push(e.to);}}}if(dis[t]==0)return 0;return 1;
}int current[N];
long long dfs(int x,long long maxflow)
{if(x==t)return maxflow;
//    printf("%d %lld\n",x,maxflow);for(int i=current[x];i!=-1;i=edg[i].next){current[x]=i;ss &e=edg[i];if(e.flow>0&&dis[e.to]==dis[x]+1){long long flow=dfs(e.to,min(maxflow,e.flow));if(flow!=0){e.flow-=flow;edg[i^1].flow+=flow;return flow;}}}return 0;
}long long dinic()
{long long ans=0,flow;while(bfs()){for(int i=0;i<N;i++)current[i]=head[i];while(flow=dfs(s,INF))ans+=flow;}return ans;
}int cap[25];
int si[25][50];int pre[N];int Find(int x)
{int boss=x;while(boss!=pre[boss])boss=pre[boss];;while(x!=boss){int now=pre[x];pre[x]=boss;x=now;}return boss;
}void init()
{now_edge=0;memset(head,-1,sizeof(head));for(int i=0;i<N;i++)pre[i]=i;
}int main()
{init();int n,m,k;scanf("%d %d %d",&n,&m,&k);for(int i=1;i<=m;i++){scanf("%d %d",&cap[i],&si[i][0]);for(int j=1;j<=si[i][0];j++)scanf("%d",&si[i][j]);}for(int i=1;i<=m;i++)for(int j=1;j<si[i][0];j++){int u=si[i][j],v=si[i][j+1];if(u==0)u=n+1;elseif(u==-1)u=n+2;if(v==0)v=n+1;elseif(v==-1)v=n+2;pre[Find(u)]=Find(v);}if(Find(n+1)!=Find(n+2)){printf("0\n");return 0;}s=N-3,t=N-2;addedge(s,n+1,INF);addedge(n+2,t,INF);int now=dinic(),flo=1;while(now<k){for(int i=1;i<=m;i++){int  t=(flo%si[i][0]==0) ? si[i][si[i][0]] : si[i][flo%si[i][0]];int tt=((flo+1)%si[i][0]==0) ? si[i][si[i][0]] : si[i][(flo+1)%si[i][0]];int u,v;if(t==0)u=(flo-1)*(n+2)+n+1;elseif(t==-1)u=(flo-1)*(n+2)+n+2;elseu=(flo-1)*(n+2)+t;if(tt==0)v=(flo)*(n+2)+n+1;elseif(tt==-1)v=(flo)*(n+2)+n+2;elsev=(flo)*(n+2)+tt;// printf("%d %d %d %d %d %d\n",t,tt,u,v,flo,cap[i]);//  system("pause");
            addedge(u,v,cap[i]);addedge((flo-1)*(n+2)+i,flo*(n+2)+i,INF);}addedge(s,flo*(n+2)+n+1,INF);addedge(flo*(n+2)+n+2,t,INF);flo++;now+=dinic();//printf("%d \n",now);// system("pause");
    }printf("%d\n",flo-1);return 0;}