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

using namespace std;
using namespace __gnu_pbds;

#ifdef DEBUG
template<typename T1,typename T2>auto& operator<<(ostream&o,pair<T1,T2>a){return o<<"("<<a.first<<", "<<a.second<<")";}
template<typename T,size_t...I>void pt(ostream&o,T t,index_sequence<I...>){o<<"(";(...,(o<<(I?", ":"")<< get<I>(t)));o<<")";}
template<typename...A>auto& operator<<(ostream&o,tuple<A...>t){pt(o,t,index_sequence_for<A...>{});return o;}
template<typename T,typename O>auto& operator<<(O&o,T a){o<<"{";for(auto b:a)o<<b<<", ";return o<<"}";}
#define db(x...) cerr << "\033[92m" << "[" #x "]: ", [](auto... args) { ((cerr << args << ", "),...) << "\033[0m" << "\n"; }(x)
#else
#define db(...)
#endif

#define sz(x) ((int)(x).size()) 
#define all(x) (x).begin(), (x).end()
#define F first
#define S second

template<class T>
using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using vi = vector<int>;

mt19937 mrand(random_device{}());
ll rnd(ll l, ll r) { return l + mrand() % (r - l + 1);}

int main() {
    cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);

    ll n, m, k;
    cin >> n >> m >> k;

    vector<vector<ll>> v(n, vector<ll>(m));
    for(ll i = 0 ; i < n ; ++i) {
        for(ll j = 0 ; j < m ; ++j) {
            cin >> v[i][j];
        }
    }

    vector<bool> desc(n, true);
    vector<vector<ll>> low;
    vector<ll> dp1;
    for(ll i = 0 ; i < n ; ++i) {
        for(ll j = 1 ; j < m ; ++j) {
            if(v[i][j-1] < v[i][j]) 
                desc[i] = false;
        }
        if(!desc[i]) {
            low.emplace_back(v[i]);
            continue;
        }
        for(auto x : v[i]) dp1.emplace_back(x);
    }
    sort(all(dp1), greater<>());
    dp1.resize(k+1);
    for(ll i = 1 ; i <= k ; ++i) {
        dp1[i] += dp1[i-1];
    }

    ll ans = 0;
    vector<pll> dp2;

    for(ll i = 0 ; i < sz(low) ; ++i) {
        for(ll j = 1 ; j < m ; ++j) {
            low[i][j] += low[i][j-1];
        }
        dp2.emplace_back(low[i][m-1], i);
    }
    sort(all(dp2), greater<>());
    for(ll i = 1 ; i < sz(dp2) ; ++i) dp2[i].F += dp2[i-1].F;
    if(k <= sz(dp1)) ans = max(ans, dp1[k-1]);
    for(ll i = 0 ; i < sz(dp2) && k - (i+1)*m >= 0 ; ++i) {
        ll rest = k - (i+1)*m;
        if(rest > sz(dp1)) continue;
        ans = max(ans, dp2[i].F + (rest > 0 ? dp1[rest-1] : 0ll));
    }

    vector<ll> where(n+1);
    for(ll i = 0 ; i < sz(dp2) ; ++i) where[dp2[i].S] = i;

    auto f = [=](ll x, ll i, ll j) -> ll {
        ll res = 0, ddp = 0;
        if(k - j - x*m > 0) ddp = dp1[k - j - x*m - 1];
        if(where[i] <= x) return dp2[x].F + ddp + low[i][j-1] - low[i][m-1];
        return dp2[x-1].F + ddp + low[i][j-1]; 
    };

    for(ll i = 0 ; i < sz(low) ; ++i) {
        for(ll j = 1 ; j < m ; ++j) {
            //k-j
            ll shift = 0;
            if(k-j > sz(dp1)) shift = (k-j-sz(dp1)+m-1)/m;
            ll l = max(1LL,shift), r = min((k-j)/m, (ll)sz(dp2)-1);
            if(k-j >= 0 && k-j <= sz(dp1)) {
                ans = max(ans, low[i][j-1] + ((k-j > 0) ? dp1[k-j-1] : 0ll));
            }
            while(l < r) {
                ll mid = (l+r)/2; 
                if(f(mid, i, j) < f(mid+1, i, j)) l = mid+1;
                else r = mid;
            }
            if(l <= r) ans = max(ans, f(l, i, j));
        }
    }


    cout << ans << "\n";

    return 0;
}