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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#pragma GCC optimize("O3")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
 
//typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> oset;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}"; }
void _print() { cerr << "]\n"; }

template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }

#ifdef LOCAL
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define debug(x...)
#endif

const ll mod = 1e9+7;
const ll infi  = 1e18+1;
const ld eps = 1e-14L;

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll n, m, k; cin >> n >> m >> k;
    vector<vector<ll>> a(n, vector<ll>(m));
    vector<bool> inc(n);
    for(ll i=0;i<n;i++){
        for(ll j=0;j<m;j++){
            cin >> a[i][j];
            if(j && a[i][j-1] < a[i][j]) inc[i] = true;
        }
    }
    vector<vector<ll>> prefinc;
    priority_queue<array<ll, 3>> pq;
    for(ll i=0;i<n;i++){
        if(!inc[i]) pq.push({a[i][0], i, 0});
        else {
            vector<ll> pref(m+1);
            for(ll j=1;j<=m;j++){
                pref[j] = pref[j-1] + a[i][j-1];
            }
            prefinc.push_back(pref);
        }
    }
    ll now = 0;
    vector<ll> mxdec(k+1, -infi); mxdec[0] = 0;
    for(ll i=1;i<=k;i++){
        if(!pq.empty()){
            auto [val, ind, j] = pq.top(); pq.pop();
            now += val;
            if(j + 1 < m) pq.push({a[ind][j+1], ind, j+1});
        }
        mxdec[i] = now;
    }
    ll sajz = prefinc.size();
    vector<ll> ord(sajz); iota(ord.begin(), ord.end(), 0LL);
    
    auto comp = [&](ll i, ll j) -> bool {
        return prefinc[i][m] > prefinc[j][m];
    };

    sort(ord.begin(), ord.end(), comp);

    vector<vector<ll>> suf(sajz+1, vector<ll>(m, -infi));
    vector<vector<ll>> dif(sajz+1, vector<ll>(m, -infi));

    for(ll i=sajz-1;i>=0;i--){
        for(ll j=1;j<m;j++){
            suf[i][j] = max(suf[i+1][j], prefinc[ord[i]][j]);
        }
    }

    for(ll i=1;i<=sajz;i++){
        for(ll j=1;j<m;j++){
            dif[i][j] = max(dif[i-1][j], prefinc[ord[i-1]][j] - prefinc[ord[i-1]][m]);
        }
    }

    ll incsajz = min(k, sajz*m);
    vector<ll> mxinc(incsajz+1, -infi); mxinc[0] = 0;
    vector<ll> pref(sajz+1);
    for(ll i=1;i<=sajz;i++){
        pref[i] = pref[i-1] + prefinc[ord[i-1]][m];
    }

    for(ll i=0;i<=sajz;i++){
        ll full = i*m;
        if(full <= incsajz) mxinc[full] = pref[i];
        for(ll j=1;j<m;j++){
            if(full+j<=incsajz){ 
                mxinc[full+j] = max(mxinc[full+j], pref[i] + suf[i][j]);
                if(i+1<=sajz) mxinc[full+j] = max(mxinc[full+j], pref[i+1] + dif[i+1][j]);
            }
        }
    }
    ll ans = 0;
    for(ll i=0;i<=k;i++){
        ll j = k - i;
        if(j > incsajz) continue;
        ans = max(ans, mxdec[i] + mxinc[j]);
    }
    cout << ans << '\n';
    return 0;
}