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
#include <bits/stdc++.h>

//#define DEBUG
using namespace std;

#define ll long long

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;

typedef pair<int,int> ii;

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

const int MOD = 998244353;

ll read(){
    ll i;
    cin>>i;
    return i;
}

vi readvi(int n,int off=0,int shift=0){
    vi v(n+shift);
    rep(i,shift)v[i]=0;
    rep(i,n)v[i+shift]=read()+off;
    return v;
}

vl readvl(int n,int off=0,int shift=0){
    vl v(n+shift);
    rep(i,shift)v[i]=0;
    rep(i,n)v[i+shift]=read()+off;
    return v;
}
void YesNo(bool condition, bool do_exit=true) {
    if (condition)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    if (do_exit)
        exit(0);
}

int main(void ) {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n,m,k;
    cin >> n >> m >> k;
    vvl inc;
    vl dec;

    rep(i,n) {
        vl s = readvl(m);
        if (m == 1 or s[0] >= s[s.size() - 1])
            rep(j,m)
                dec.push_back(s[j]);
        else
            inc.push_back(s);
    }

    sort(dec.begin(), dec.end(), greater<ll>());
    dec.resize(min(k, (int)dec.size()));

    vl total(size(inc), 0);
    rep (i, size(inc))
        rep(j,m)
            total[i] += inc[i][j];

    vi ind(size(inc));
    rep(i,size(inc))
        ind[i] = i;

    sort(ind.begin(), ind.end(), [&total](ll a, ll b) {return total[a] > total[b];});

#ifdef DEBUG
    for (auto x : ind)
        cout << x << " ";
    cout << endl;
#endif

    vvl new_inc;
    rep(i, size(inc))
        new_inc.push_back(inc[ind[i]]);

    swap(inc,new_inc);

    vvl sum_pref(size(inc));
    rep (i, size(inc)) {
        sum_pref[i].push_back(0);
        rep(j,m)
            sum_pref[i].push_back(sum_pref[i][j] + inc[i][j]);
    }

#ifdef DEBUG
    cout << "inc\n";
    for (auto v : inc) {
        ll tot = 0;
        rep(j,m) {
            cout << v[j] << " ";
            tot += v[j];
        }
        cout << '|' << tot << endl;
    }

    cout << "dec\n";
    for (auto x : dec)
        cout << x << " ";
    cout << endl;
#endif

    vvl max_pref(inc.size()+1, vl(m, 0));
    // max_pref[i][r] = maksymalna suma r-prefiksu spośród stosów i..inc.size()-1
    for (int i = inc.size()-1; i >= 0; i--)
        rng(r,1,m)
            max_pref[i][r] = max(max_pref[i+1][r], sum_pref[i][r]);

    vvl min_suf(inc.size()+1, vl(m, 0));
    // min_suf[i][r] = minimalna suma sufiksu od r+1..m-1 spośród stosów 0..i
    if (inc.size()) {
        rep(r,m)
            min_suf[0][r] = sum_pref[0][m] - sum_pref[0][r];
        rng(i,1,inc.size())
            rep(r,m)
                min_suf[i][r] = min(min_suf[i-1][r], sum_pref[i][m] - sum_pref[i][r]);
    }

    ll total_dec = 0;
    rep(i,dec.size())
        total_dec += dec[i];

    vl total_inc_pref;
    total_inc_pref.push_back(0);
    rep(i,size(inc))
        total_inc_pref.push_back(total_inc_pref[i]+sum_pref[i][m]);

    ll res = 0;
    for(int i = dec.size(); i>=max(0,k-m*(int)inc.size()); --i) {
        // bierzemy i z malejących
        int k1 = k - i;
        int r = k1 % m;
        int num_inc = k1 / m;

        ll act = total_dec + total_inc_pref[num_inc] + max(max_pref[num_inc][r], num_inc > 0 and num_inc < (int)inc.size() ? sum_pref[num_inc][m] - min_suf[num_inc-1][r] : 0);
        res = max(res, act);

        if (i)
            total_dec -= dec[i-1];
    }

    cout << res << endl;

    return 0;
}