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
#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;

typedef long long ll;
typedef long double ld;

#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define debug false

const ll INF = ll(-1000 * 1000 * 1000) * ll(1000 * 1000 * 1000);
const int MAXN = 300 * 1000 + 17;
vector<ll> a[MAXN];
vector<ll> v;
vector<pair<ll, int>> vr;
ll mal[MAXN];
ll ros[MAXN];
ll l[MAXN];
multiset<ll> r[MAXN];

int main () {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m, k;
    cin >> n >> m >> k;

    ll x;
    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < m; j ++) {
            cin >> x;
            a[i].pb(x);
        }
    }

    for (int i = 1; i <= n * m; i ++) {
        mal[i] = INF;
        ros[i] = INF;
        l[i] = INF;
    }

    for (int i = 0; i < n; i ++) {
        if (a[i][0] >= a[i].back()) {
            for (auto x : a[i]) {
                v.pb(x);
            }
        } else {
            ll s = 0;
            for (auto x : a[i]) {
                s += x;
            }
            vr.pb({s, i});
        }
    }

    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());

    int r1 = int(v.size());
    for (int i = 1; i <= r1; i ++) {
        mal[i] = mal[i - 1] + v[i - 1];
    }

    sort(vr.begin(), vr.end());
    reverse(vr.begin(), vr.end());

    int r2 = int(vr.size());
    for (auto x : vr) {
        ll s = 0;
        for (int i = 0; i < m; i ++) {
            s += a[x.nd][i];
            r[i + 1].insert(s);
            ros[i + 1] = max(ros[i + 1], s);
        }
    }

    ll akt = 0;
    for (int i = 0; i < r2; i ++) {
        akt += vr[i].st;

        ll s = 0;
        for (int j = 0; j < m; j ++) {
            s += a[vr[i].nd][j];
            r[j + 1].erase(r[j + 1].find(s));
            l[j + 1] = max(l[j + 1], s - vr[i].st);
        }

        if (i != (r2 - 1)) {
            for (int j = 0; j < m; j ++) {
                int ile = (i + 1) * m + j;
                ll maks = 0;
                if (j != 0) {
                    maks = *r[j].rbegin();
                }
                ros[ile] = max(ros[ile], akt + maks);

                if (j != 0) {
                    ros[ile] = max(ros[ile], akt + l[j] + vr[i + 1].st);
                }
            }
        } else {
            int ile = (i + 1) * m;
            ros[ile] = max(ros[ile], akt);
        }
    }

    ll wyn = 0;
    for (int i = 0; i <= min(r1, k); i ++) {
        wyn = max(wyn, mal[i] + ros[k - i]);
    }


    cout << wyn << "\n";

    return 0;
}