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
#include <bits/stdc++.h>
#pragma GCC target ("avx2,fma")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
const ll mod=1000000007;

#ifdef LOCAL
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

const int N=300007;

vector<ll>a[N];
ll mx[N],T[N],S[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    vector<pair<ll,int>>V;
    vector<ll>R;
    FOR(i,1,n)
    {
		a[i].resize(m);
		bool is=0;
		FOR(j,0,m-1)
		{
			cin>>a[i][j];
			S[i]+=a[i][j];
			if(j>0&&a[i][j]>a[i][j-1]) is=1;
		}
		if(is) V.pb({S[i],i});
		else FOR(j,0,m-1) R.pb(a[i][j]);
	}
	sort(all(V),greater<pair<ll,int>>());
	sort(all(R),greater<ll>());
	FOR(j,1,m) T[j]=-infl;
	ll X=0,c=0;
	for(auto [x,i]:V)
	{
		ll p=0;
		FOR(j,0,m-1)
		{
			p+=a[i][j];
			T[j+1]=max(T[j+1],p-S[i]);
		}
		X+=S[i],c++;
		FOR(j,1,m) mx[(c-1)*m+j]=max(mx[(c-1)*m+j],X+T[j]);
	}
	FOR(j,1,m) T[j]=-infl;
	reverse(all(V));
	for(auto [x,i]:V)
	{
		ll p=0;
		FOR(j,0,m-1)
		{
			p+=a[i][j];
			T[j+1]=max(T[j+1],p);
		}
		X-=S[i],c--;
		FOR(j,1,m) mx[c*m+j]=max(mx[c*m+j],X+T[j]);
	}
	FOR(i,1,k) mx[i]=max(mx[i],mx[i-1]);
	FOR(i,1,sz(R)-1) R[i]+=R[i-1];
	ll ans=mx[k];
	FOR(i,0,k-1) if(k-i<=sz(R)) ans=max(ans,mx[i]+R[k-i-1]);
	cout<<ans<<endl;
    return 0;
}