// codevs1033#include<algorithm>#include<iostream>#include<cstring>#include<cstdlib>#include<cstdio>#include<cmath>#include<queue>#define LL long long#define inf 2147483640#define Pi acos(-1.0)#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);using namespace std; const int maxn=10000;struct edge {int from,to,next,w,c;}e[maxn*100];int head[maxn],vis[maxn],p[maxn],f[maxn],dis[maxn];int n,m,es,et,K,cnt=1,a[1000][1000];void link(int u,int v,int w,int c) {	e[++cnt]=(edge){u,v,head[u],w,c};head[u]=cnt;	e[++cnt]=(edge){v,u,head[v],0,-c};head[v]=cnt;}int SPFA() {	queue<int> q;q.push(es);	memset(dis,-1,sizeof(dis));	dis[es]=0;f[es]=inf;	while (!q.empty()) {		int x=q.front();q.pop();		vis[x]=0;		for (int i=head[x];i;i=e[i].next) if (e[i].w && dis[e[i].to]<dis[x]+e[i].c) {				dis[e[i].to]=dis[x]+e[i].c;				f[e[i].to]=min(e[i].w,f[x]);				p[e[i].to]=i;				if (!vis[e[i].to]) q.push(e[i].to),vis[e[i].to]=1;			}	}	if (dis[et]<0) return 0;	for (int i=p[et];i;i=p[e[i].from]) e[i].w-=f[et],e[i^1].w+=f[et];	return f[et]*dis[et];}int EK() {	int ans=0;	for (int i=1;i<=K;i++)		ans+=SPFA();	return ans;}int main() {	scanf("%d%d%d",&n,&m,&K);	for (int i=1;i<=n;i++)		for (int j=1;j<=m+i-1;j++) a[i][j]=++es;	es++;et=es+1;	for (int i=1;i<=n;i++)		for (int x,j=1;j<=m+i-1;j++) {			scanf("%d",&x);			int u=a[i][j],v=a[i][j]+et;			link(u,v,1,x);link(u,v,inf,0);			if (i==1) link(es,u,inf,0);			if (i==n) link(v,et,inf,0);			if (i>1 && j>1) link(a[i-1][j-1]+et,u,1,0);			if (i>1 && j<m+i-1) link(a[i-1][j]+et,u,1,0);		}	printf("%d",EK());	return 0;}