#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,a[3009][3009],sline[3009],srow[3009],k,need[9000009];
int main(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			scanf("%d",&a[i][j]);
			sline[i]+=a[i][j];  srow[j]+=a[i][j];
		}
	}
	ll now=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			ll sum=sline[i]+srow[j]-a[i][j];
			if(sum-a[i][j]<=0){
				need[++now]=0;
				continue;
			} 
			ll ans=(sum-a[i][j])/(n+m-2);
			if((sum-a[i][j])%(n+m-2))  ans++;
			need[++now]=ans;
		}
	}
	sort(need+1,need+n*m+1);
	cout<<need[k]<<endl;
	return 0;
}