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

using namespace std;
#define PB push_back
#define LL long long
#define int LL
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORD(i,a,b) for (int i = (a); i >= (b); i--)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define st first
#define nd second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define VI vector<int>
#define PII pair<int,int>
#define LD long double

template<class C> void mini(C& a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C& a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;
  cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream &os, vector<T> V){
  os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]";
} 

template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
  return os << "(" << P.st << "," << P.nd << ")";
}


#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

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

    vector<VI> stacks(n, VI(m));
    REP(i, n) {
        REP(j, m) {
            cin >> stacks[i][j];
        }
    }

    VI desc_pool;
    vector<VI> asc_pref;
    VI asc_total;

    REP(i, n){
        bool ascending = (m >= 2 && stacks[i][0] < stacks[i][m-1]);
        if(!ascending){
            REP(j, m) desc_pool.push_back(stacks[i][j]);
        } else {
            VI ps(m+1, 0);
            REP(j, m) ps[j+1] = ps[j] + stacks[i][j];
            asc_pref.push_back(ps);
            asc_total.push_back(ps[m]);
        }
    }

    sort(ALL(desc_pool), greater<int>());
    int D = desc_pool.size();
    VI desc_ps(D+1, 0);
    REP(i, D) desc_ps[i+1] = desc_ps[i] + desc_pool[i];

    int A = asc_total.size();

    vector<PII> asc_ord(A);
    REP(i, A) asc_ord[i] = {-asc_total[i], i};
    sort(ALL(asc_ord));

    VI sorted_total(A);
    VI rank_of(A);
    REP(i, A){
        sorted_total[i] = asc_total[asc_ord[i].nd];
        rank_of[asc_ord[i].nd] = i;
    }

    VI asc_ps(A+1, 0);
    REP(i, A) asc_ps[i+1] = asc_ps[i] + sorted_total[i];

    int ans = 0;

    REP(ii, A){
        int r = rank_of[ii];
        for(int p = 1; p < m; p++){
            if(p > k) break;
            int pval = asc_pref[ii][p];
            int budget = k - p;
            if(budget < 0) continue;

            int max_full = A - 1;
            int a_max = min(max_full, budget / m);
            int a_min = 0;
            if(budget > D)
                a_min = (budget - D + m - 1) / m;
            if(a_min > a_max) continue;

            int lo = a_min, hi = a_max;
            while(hi - lo > 2){
                int m1 = lo + (hi - lo) / 3;
                int m2 = hi - (hi - lo) / 3;
                int rem1 = budget - m1 * m, rem2 = budget - m2 * m;
                int v1 = (m1 <= r ? asc_ps[m1] : asc_ps[m1+1] - sorted_total[r]) + pval + desc_ps[rem1];
                int v2 = (m2 <= r ? asc_ps[m2] : asc_ps[m2+1] - sorted_total[r]) + pval + desc_ps[rem2];
                if(v1 < v2) lo = m1; else hi = m2;
            }

            FOR(a, lo, hi){
                int rem = budget - a * m;
                int v = (a <= r ? asc_ps[a] : asc_ps[a+1] - sorted_total[r]) + pval + desc_ps[rem];
                maxi(ans, v);
            }
        }
    }

    {
        int budget = k;
        int a_max = min(A, budget / m);
        int a_min = 0;
        if(budget > D)
            a_min = (budget - D + m - 1) / m;

        if(a_min <= a_max){
            int lo = a_min, hi = a_max;
            while(hi - lo > 2){
                int m1 = lo + (hi - lo) / 3;
                int m2 = hi - (hi - lo) / 3;
                int v1 = asc_ps[m1] + desc_ps[budget - m1 * m];
                int v2 = asc_ps[m2] + desc_ps[budget - m2 * m];
                if(v1 < v2) lo = m1; else hi = m2;
            }

            FOR(a, lo, hi){
                maxi(ans, asc_ps[a] + desc_ps[budget - a * m]);
            }
        }
    }

    cout << ans << "\n";
    return 0;
}