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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
template<class T>
using vec = vector<T>;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KoRoVa
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = -1, inf = 1000111222;

const ll linf = 1000111222000111222;

void test_case() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<ll> > asc;
    vector<vector<ll> > desc;
    for (int i = 0; i < n; i++) {
        vector<ll> a(m + 1);
        for (int j = 1; j <= m; j++) {
            cin >> a[j];
        }
        bool inc = true;
        for (int j = 1; j < m; j++) {
            if (a[j] > a[j + 1]) {
                inc = false;
                break;
            }
        }
        if (inc) {
            vector<ll> pref(m + 1, 0);
            for (int j = 1; j <= m; j++) {
                pref[j] = pref[j - 1] + a[j];
            }
            asc.pb(pref);
        } else {
            vector<ll> cur(m);
            for (int j = 1; j <= m; j++) {
                cur[j - 1] = a[j];
            }
            desc.pb(cur);
        }
    }
    int desc_total = len(desc) * m;
    int up = min(k, desc_total);
    vector<ll> best_desc(up + 1, -linf);
    best_desc[0] = 0;
    priority_queue<tuple<ll, int, int> > pq;
    for (int i = 0; i < len(desc); i++) {
        pq.emplace(desc[i][0], i, 0);
    }
    for (int t = 1; t <= up; t++) {
        auto [val, id, pos] = pq.top();
        pq.pop();
        best_desc[t] = best_desc[t - 1] + val;
        if (pos + 1 < m) {
            pq.emplace(desc[id][pos + 1], id, pos + 1);
        }
    }
    sort(all(asc), [&](const vector<ll> &x, const vector<ll> &y) {
        return x[m] > y[m];
    });
    int s = len(asc);
    vector<ll> pref_sum(s + 1, 0);
    for (int i = 1; i <= s; i++) {
        pref_sum[i] = pref_sum[i - 1] + asc[i - 1][m];
    }
    vector<ll> best_asc(k + 1, -linf);
    for (int full = 0; full <= min(s, k / m); full++) {
        best_asc[full * m] = pref_sum[full];
    }
    if (s > 0) {
        vector<ll> pref_best(s + 1), suff_best(s + 2);
        for (int take = 1; take < m; take++) {
            pref_best[0] = -linf;
            for (int i = 1; i <= s; i++) {
                pref_best[i] = max(pref_best[i - 1], asc[i - 1][take] - asc[i - 1][m]);
            }
            suff_best[s + 1] = -linf;
            for (int i = s; i >= 1; i--) {
                suff_best[i] = max(suff_best[i + 1], asc[i - 1][take]);
            }
            for (int full = 0; full < s; full++) {
                ll cnt = full * m + take;
                if (cnt > k) break;
                ll cur = -linf;
                if (suff_best[full + 1] > -linf / 2) {
                    umax(cur, pref_sum[full] + suff_best[full + 1]);
                }
                if (pref_best[full] > -linf / 2) {
                    umax(cur, pref_sum[full + 1] + pref_best[full]);
                }
                umax(best_asc[cnt], cur);
            }
        }
    }
    ll ans = 0;
    for (int take_asc = 0; take_asc <= k; take_asc++) {
        if (best_asc[take_asc] <= -linf) continue;
        ll take_desc = k - take_asc;
        if (take_desc < 0 || take_desc > up) continue;
        if (best_desc[take_desc] <= -linf) continue;
        umax(ans, best_asc[take_asc] + best_desc[take_desc]);
    }
    cout << ans << '\n';
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;

//    cin >> t;

    while (t--) test_case();

    return 0;
}

/*
KoRoVa!
*/