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
/*
Runda 2 - 
*/

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<queue>
#include<stack>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <chrono>

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<VLL > VVLL;
typedef vector<VLD > VVLD;
typedef vector<PII > VPII;
typedef vector<PLL > VPLL;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<class T> using max_heap = priority_queue<T>;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define THIS (*this)
#define LSB(x) (x & -x)
#define SQR(x) ((x)*(x))

int n, m, k;
VVLL a;
max_heap<pair<LL, int> > decq, incq;
VI isInc;

VLL getBestDec() {
    VLL ans(k + 1);
    int cnt = 0;
    while (!decq.empty() && cnt < k) {
        auto [val, id] = decq.top(); decq.pop();
        ans[cnt + 1] = ans[cnt] + val; cnt++;
        a[id].pop_back();
        if (!a[id].empty()) decq.push({a[id].back(), id});
    }
    return ans;
}

VLL getBestInc() {
    VLL ans(k + 1);
    VVLL prefs; prefs.reserve(n);
    REP(i, n) if (isInc[i]) {
        VLL tmp(m); tmp[0] = a[i].back();
        FOR(j, 1, m - 1) tmp[j] = tmp[j - 1] + a[i][m - j - 1];
        prefs.PB(tmp);
    }
    sort(ALL(prefs), [](const VLL &a, const VLL &b) {
        return a.back() > b.back();
    });
    for (int i = 1; i * m <= k && i <= prefs.size(); i++) ans[i * m] = ans[(i - 1) * m] + prefs[i - 1].back();
    FOR(r, 1, m - 1) {
        VLL rpref(prefs.size()), diff(prefs.size()); 
        REP(i, prefs.size()) { 
            rpref[i] = prefs[i][r - 1];
            diff[i] = prefs[i][r - 1] - prefs[i].back();
        }
        //cout << "r: " << r << "\n";
        //REP(i, prefs.size()) cout << rpref[i] << " "; cout << "\n";
        //REP(i, prefs.size()) cout << diff[i] << " "; cout << "\n";
        VLL bestDiffPref(prefs.size() + 1, -1e18);
        REP(i, prefs.size()) bestDiffPref[i + 1] = max(bestDiffPref[i],  diff[i]);
        VLL bestRPrefSuf(prefs.size() + 1);
        FORD(i, prefs.size() - 1, 0) bestRPrefSuf[i] = max(bestRPrefSuf[i + 1], rpref[i]);
        //REP(i, prefs.size() + 1) cout << bestDiffPref[i] << " "; cout << "\n";
        //REP(i, prefs.size() + 1) cout << bestRPrefSuf[i] << " ";cout << "\n";
        LL sum = 0;
        for (int i = 0; i * m + r <= k && i < prefs.size(); i++) {
            LL best = max(bestRPrefSuf[i], bestDiffPref[i] + prefs[i].back());
            ans[i * m + r] = sum + best;
            sum += prefs[i].back();
        }
    }
    return ans;
}

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    cin >> n >> m >> k;
    a.assign(n, VLL(m));
    isInc.assign(n, 0);
    REP(i, n) {
        REP(j, m) cin >> a[i][m - j - 1];
        if (a[i].back() >= a[i][0]) decq.push({a[i].back(), i});
        else {
            LL sum = 0;
            FORD(j, m - 1, 0) sum += a[i][j];
            incq.push({sum, i});
            isInc[i] = 1;
        }
    }
    VLL bestDec = getBestDec();
    VLL bestInc = getBestInc();
    LL ans = 0;
    //REP(i, bestDec.size()) cout << bestDec[i] << " "; cout << "\n";
    //REP(i, bestInc.size()) cout << bestInc[i] << " "; cout << "\n";
    FOR(i, 0, k) ans = max(ans, bestDec[i] + bestInc[k - i]);
    cout << ans << "\n";

    return 0;
}