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
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,m,k;
    cin >> n >> m >> k;
    vl s1;
    vector<pair<ll,vl>> s2;
    rep(i,n)
    {
        vl x(m);
        rep(j,m) cin >> x[j];
        ll sum = 0;
        forall(it,x) sum += it;
        if(x[0] >= x[m-1]) forall(it,x) s1.pb(it);
        else s2.pb({sum,x});
    }
    sort(all(s1));
    reverse(all(s1));
    rep2(i,1,siz(s1)-1) s1[i] += s1[i-1];
    n = siz(s2);
    sort(all(s2));
    reverse(all(s2));
    vector<vl> best_pref(n,vl(m,0)),best_suf(n,vl(m+1,0));
    rep(i,n)
    {
        ll suf = 0;
        for(int j = m-1; j >= 0; j--)
        {
            suf += s2[i].ss[j];
            if(i != 0) best_suf[i][j] = min(suf,best_suf[i-1][j]);
            else best_suf[i][j] = suf;
        }
        if(i != 0) s2[i].ff += s2[i-1].ff;
    }
    for(int i = n-1; i >= 0; i--)
    {
        ll pref = 0;
        rep(j,m)
        {
            pref += s2[i].ss[j];
            if(i != n-1) best_pref[i][j] = max(pref,best_pref[i+1][j]);
            else best_pref[i][j] = pref;
        }
    }
    ll ans = 0;
    rep(i,min(k+1,siz(s1)+1))
    {
        int k2 = k-i;
        if(siz(s2)*m < k2) continue;
        ll ans1 = 0;
        ll ans2 = 0;
        int d = k2/m;
        if(d != 0) ans1 += s2[d-1].ff;
        if(d != siz(s2) && k2-d*m-1 >= 0) ans1 += best_pref[d][k2-d*m-1];
        d = (k2+m-1)/m;
        if(d != 0) ans2 = s2[d-1].ff-best_suf[d-1][m-(d*m-k2)];
        if(i != 0) ans = max(ans,max(ans1,ans2)+s1[i-1]);
        else ans = max({ans,ans1,ans2});
    }
    cout << ans << "\n";
}