60pts求条，玄关

#include<bits/stdc++.h>
#define int long long

using namespace std;
const int N=2e1+10;
int n,m,k,a;
int cnt,ans;
struct node
{
	int x,y,s;
}p[N];

inline bool cmp(node x,node y)
{
	return x.s>y.s;
} 

signed main()
{
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>a;
			if(a>0)
			{
				cnt++;
				p[cnt].x=i;
				p[cnt].y=j;
				p[cnt].s=a;
			}
		}
	}
	sort(p+1,p+cnt+1,cmp);
	for(int i=1;i<=cnt;i++)
	{
		if(i==1)
		{
			if(k<=p[i].x+p[i].x)
			break;
			ans+=p[i].s;
			k-=p[i].x+1;
		}
		else
		{
			if(k<=abs(p[i-1].x-p[i].x)+abs(p[i-1].y-p[i].y)+p[i].x)
			break;
			ans+=p[i].s;
			k-=abs(p[i-1].x-p[i].x)+abs(p[i-1].y-p[i].y)+1;
		}
	}
	cout<<ans;
	return 0;
}