#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[111][111];
ll n, m, k;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m >> k;
	for (ll i = 1; i <= n; i++) {
		for (ll j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
	}
	ll sum_row[111] = {0};
	ll sum_col[111] = {0};
	for (ll i = 1; i <= n; i++) {
		for (ll j = 1; j <= m; j++) {
			sum_row[i] += a[i][j];
			sum_col[j] += a[i][j];
		}
	}
	vector<ll> r;
	for (ll i = 1; i <= n; i++) {
		for (ll j = 1; j <= m; j++) {
			ll val = sum_row[i] + sum_col[j] - a[i][j];
			
			ll t_ij;
			if (val <= 0) {
				t_ij = 0;
			} else {
				t_ij = (val + (n + m - 2)) / (n + m - 1);
			}
			
			r.push_back(t_ij);
		}
	}
	sort(r.begin(), r.end());
	cout << r[k - 1] << endl;
	
	return 0;
}