#include<bits/stdc++.h> using namespace std; const int N = 3e4+5,L=15; int n,l,a[N][L],pm[N][L],p[N],dp[N],mxdp[N]; int cmp(int x,int y){ int cnt = 0; for(int i = 1;i<=l;i++)for(int j = i+1;j<=l;j++)if(pm[x][a[y][i]]>pm[x][a[y][j]])cnt++; return cnt; } int calc(int x){return x*(x-1)/2;} int main(){ scanf("%d%d",&n,&l); for(int i = 1;i<=l;i++)a[0][i]=i,pm[0][i]=i; for(int i = 1;i<=n;i++){ scanf("%d",&p[i]);dp[i]=-4e8; for(int j = 1;j<=l;j++) {scanf("%d",&a[i][j]);pm[i][a[i][j]]=j;} } dp[0]=0; for(int i = 1;i<=n;i++){ if(i>=calc(l))dp[i]=max(mxdp[i-calc(l)]+p[i],dp[i]); for(int j = max(i-calc(l),0);j<i;j++){if(cmp(j,i)<=i-j)dp[i]=max(dp[j]+p[i],dp[i]);} mxdp[i]=max(mxdp[i-1],dp[i]); } printf("%d\n",mxdp[n]); }