1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define PB push_back
#define EB emplace_back
#define FI first
#define SE second
#define umap unordered_map
#define uset unordered_set
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vpii vector<pii>
#define pii pair<int, int>
#define pll pair<ll, int>
#define ALL(X) (X).begin(),(X).end()
#ifndef DEBUG
#define endl (char)10
#endif
using namespace std;
using ll = long long;
using ld = long double;

template <class T>
ostream& operator<< (ostream& os, const vector<T>& vec){
    for(auto& t : vec) os << t << " ";
    return os;
}
template<class T, class U>
ostream& operator<< (ostream& os, const pair<T, U>& p){
    os << p.FI << " " << p.SE;
    return os;
}
template<class T, class U>
istream& operator>> (istream& is, pair<T, U>& p){
    is >> p.FI >> p.SE;
    return is;
}
template <class T>
istream& operator>> (istream& is, vector<T>& vec){
    for(auto& p : vec) is >> p;
    return is;
}

bool isros(vll& V){
	FOR(i,1,V.size()) if (V[i] < V[i - 1]) return false;
	return true;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m, k;
    cin >> n >> m >> k;
    vvll V(n, vll(m));
    cin >> V;
    vi R, M;
    FOR(i,0,n){
		if (isros(V[i])) R.PB(i);
		else M.PB(i);
	}
	swap(M, R);
	vll A(k + 1, 0), B(k + 1, 0);

	// rosnace stosy
	vi pom(n, 0);
	priority_queue<pll> Q;
	for(int i : R) Q.emplace(V[i][0], i);
	int t = 0;
	while (t < k && !Q.empty()){
		auto [s, l] = Q.top();
		//cout << "pop " << s << " " << l << endl;
		Q.pop();
		A[t + 1] = A[t] + s;
		t++;
		pom[l]++;
		if (pom[l] < m) Q.emplace(V[l][pom[l]], l);
	}

	// malejace stosy
    for(int i : M) FOR(j,1,m) V[i][j] += V[i][j - 1];
	sort(ALL(M), [&V, m](int i, int j) {return V[i][m - 1] > V[j][m - 1]; });
	{
		ll s = 0;
		int v = m;
		FOR(b,0,M.size()){
			if (v > k) break;
			s += V[M[b]][m - 1];
			B[v] = s;
			v += m;
		}
	}
	vll ms(M.size() + 1);
	FOR(r,1,m){
		ms[M.size()] = 0;
		FORD(i,M.size()-1,0) ms[i] = max(ms[i + 1], V[M[i]][r - 1]);
		ll s = 0;
		ll h = LLONG_MIN;
		FOR(b,0,M.size()){
			int v = b * m + r;
			if (v > k) break;
			h = max(h, V[M[b]][r - 1] - V[M[b]][m - 1]);
			B[v] = max(s + ms[b], s + V[M[b]][m - 1] + h);
			s += V[M[b]][m - 1];
		}
	}

	//cout << R << endl << M << endl;
	//cout << A << endl << B << endl;


	ll ans = A[k] + B[0];
	FOR(i,0,k) ans = max(ans, A[i] + B[k - i]);
	cout << ans << endl;
}