1 // 2 //by coolxxx 3 //#include<bits/stdc++.h> 4 #include<iostream> 5 #include<algorithm> 6 #include<string> 7 #include<iomanip> 8 #include<map> 9 #include<stack>10 #include<queue>11 #include<set>12 #include<bitset>13 #include<memory.h>14 #include<time.h>15 #include<stdio.h>16 #include<stdlib.h>17 #include<string.h>18 //#include<stdbool.h>19 #include<math.h>20 #define min(a,b) ((a)<(b)?(a):(b))21 #define max(a,b) ((a)>(b)?(a):(b))22 #define abs(a) ((a)>0?(a):(-(a)))23 #define lowbit(a) (a&(-a))24 #define sqr(a) ((a)*(a))25 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))26 #define mem(a,b) memset(a,b,sizeof(a))27 #define eps (1e-8)28 #define J 1029 #define mod 100000000730 #define MAX 0x7f7f7f7f31 #define PI 3.1415926535897932332 #define N 10433 using namespace std;34 typedef long long LL;35 int cas,cass;36 int n,m,lll,ans;37 int a[N][N];38 int sum,total;39 int main()40 {41 //    freopen("easy.in","r",stdin);42 //    freopen("easy.out","w",stdout);43     int i,j,k;44     45 //    for(scanf("%d",&cass);cass;cass--)46 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)47 //    while(~scanf("%s",s+1))48     while(~scanf("%d",&n))49     {50         mem(a,0);sum=0,total=0;51         scanf("%d",&m);52         for(i=1;i<=n;i++)53         {54             scanf("%d",&a[i][0]);55             for(j=1;j<=a[i][0];j++)56             {57                 scanf("%d",&a[i][j]);58             }59         }60         for(j=1;j<=10 && total!=m;j++)61         {62             for(i=1;i<=n && total!=m;i++)63             {64                 if(j>a[i][0])65                 {66                     sum+=50;67                     total++;68                     continue;69                 }70                 if(a[i][j]>=sum)71                 {72                     sum+=a[i][j];73                     total++;74                 }75             }76         }77         if(total<m)78             sum+=50*(m-total);79         printf("%d\n",sum);80     }81     return 0;82 }83 /*84 //85 86 //87 */