#include

using namespace std;

const int L=1001;

int i,j,k,n,m,p,pastmax,nowmax;

int coin[L][L],f[L][L],step[L][L];

int cost[L],past[L];

int main(void)

{

freopen("game.in","r",stdin);

freopen("game.out","w",stdout);

memset(step,2147483647,sizeof(step));//本人推荐不用memset

cin>>n>>m>>p;

for(i=2;i<=n;i++)past[i]=i-1;

for(i=1;i<=n;i++)

for(j=1;j<=m;j++)

cin>>coin[j][i];

for(i=1;i<=n;i++)cin>>cost[i];

pastmax=0;

for(i=1;i<=m;i++)

{

nowmax=-171717171;

for(j=1;j<=n;j++)

{

if(step[i-1][past[j]]

{

if(pastmax-cost[past[j]]>f[i-1][past[j]])

{step[i][j]=1;f[i][j]=pastmax-cost[past[j]]+coin[i][past[j]];}

else {step[i][j]=step[i-1][past[j]]+1;f[i][j]=f[i-1][past[j]]+coin[i][past[j]];}

}

else {step[i][j]=1;f[i][j]=pastmax-cost[past[j]]+coin[i][past[j]];}

if(f[i][j]>nowmax)nowmax=f[i][j];

}

pastmax=nowmax;

}

cout<

return 0;

}