1 #include<cstdio>
  2 #include<cstdlib>
  3 #include<cstring>
  4 #include<iostream>
  5 #include<algorithm>
  6 #include<queue>
  7 #include<cmath>
  8 #include<vector>
  9 #include<map>
 10 using namespace std;
 11 #define Maxn 4100
 12 #define INF 0xfffffff
 13 
 14 struct node
 15 {
 16     int x,y,f,o,next;
 17 }t[Maxn*1010];int len;
 18 int first[Maxn];
 19 int n,m,k;
 20 
 21 int mymin(int x,int y) {return x<y?x:y;}
 22 int mymax(int x,int y) {return x>y?x:y;}
 23 
 24 void ins(int x,int y,int f)
 25 {
 26     t[++len].x=x;t[len].y=y;t[len].f=f;
 27     t[len].next=first[x];first[x]=len;t[len].o=len+1;
 28     t[++len].x=y;t[len].y=x;t[len].f=0;
 29     t[len].next=first[y];first[y]=len;t[len].o=len-1;
 30 }
 31 
 32 int st,ed;
 33 queue<int > q;
 34 int dis[Maxn];
 35 bool bfs()
 36 {
 37     while(!q.empty()) q.pop();
 38     memset(dis,-1,sizeof(dis));
 39     q.push(st);dis[st]=0;
 40     while(!q.empty())
 41     {
 42         int x=q.front();
 43         for(int i=first[x];i;i=t[i].next) if(t[i].f>0)
 44         {
 45             int y=t[i].y;
 46             if(dis[y]==-1)
 47             {
 48                 dis[y]=dis[x]+1;
 49                 q.push(y);
 50             }
 51         }
 52         q.pop();
 53     }
 54     if(dis[ed]==-1) return 0;
 55     return 1;
 56 }
 57 
 58 int ffind(int x,int flow)
 59 {
 60     if(x==ed) return flow;
 61     int now=0;
 62     for(int i=first[x];i;i=t[i].next) if(t[i].f>0)
 63     {
 64         int y=t[i].y;
 65         if(dis[y]==dis[x]+1)
 66         {
 67             int a=ffind(y,mymin(flow-now,t[i].f));
 68             t[i].f-=a;
 69             t[t[i].o].f+=a;
 70             now+=a;
 71         }
 72         if(now==flow) break;
 73     }
 74     if(now==0) dis[x]=-1;
 75     return now;
 76 }
 77 
 78 void output()
 79 {
 80     for(int i=1;i<=len;i+=2)
 81      printf("%d->%d %d\n",t[i].x,t[i].y,t[i].f);
 82     printf("\n");
 83 }
 84 
 85 int max_flow()
 86 {
 87     int ans=0;
 88     while(bfs())
 89     {
 90         ans+=ffind(st,INF);
 91     }
 92     return ans;
 93 }
 94 
 95 int hp[110],rl[110][110],cnt=2,add;
 96 vector<int > num[110];
 97 
 98 bool check(int x)
 99 {
100     for(int i=1;i<=n;i++) num[i].push_back(++cnt);
101     num[0].push_back(1);num[n+1].push_back(2);
102     for(int i=1;i<=m;i++)
103     {
104         int y=rl[i][(x-1)%rl[i][0]+1],z=rl[i][x%(rl[i][0])+1];
105         if(z==0||y==n+1) continue;
106         y=num[y][x];z=num[z][x+1];
107         ins(y,z,hp[i]);
108     }
109     for(int i=1;i<=n;i++) ins(num[i][x],num[i][x+1],INF);
110     int now=max_flow();
111     add+=now;
112     return add>=k;
113 }
114 
115 int main()
116 {
117     scanf("%d%d%d",&n,&m,&k);
118     for(int i=1;i<=m;i++)
119     {
120         scanf("%d%d",&hp[i],&rl[i][0]);
121         for(int j=1;j<=rl[i][0];j++)
122         {
123             scanf("%d",&rl[i][j]);
124             // printf("%d\n",rl[i][j]);
125             if(rl[i][j]==-1) rl[i][j]=n+1;
126         }
127     }
128     for(int i=1;i<=m;i++) num[i].clear();
129     for(int i=0;i<=n+1;i++) num[i].push_back(0);//00000
130     int ans=0;st=1;ed=2;
131     for(int i=1;i<=n;i++) num[i].push_back(++cnt);
132     num[0].push_back(1);num[n+1].push_back(2);
133     add=0;
134     while(1)
135     {
136         ans++;
137         if(check(ans)) {printf("%d\n",ans);break;}
138         if(ans>100) {printf("0\n");break;}
139     }
140     
141     return 0;
142 }