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
#include <bits/stdc++.h>
#include <iomanip>
 
using namespace std;
using ll = long long ;
using pii = pair <int,int> ;
using pll = pair<ll,ll> ;
using vi = vector <int> ; 
using vll = vector < ll > ;
using tiii = tuple<int,int,int> ; 
using ld = long double ; 
using vpll = vector < pll > ;

#define cYes {cout<<"YES\n";return;}
#define cNo {cout<<"NO\n";return;}
#define bra(x) "[" << (x) << "] "
#define ndl '\n' ;
#define all(x) (x).begin() , (x).end() 
#define sz(x) (int)(x).size() 
#define nd second 
#define st first
#define vvi vector<vector<int>> 

int N , M , K ;
const int maxk = 300'007 ;
vector < pair < ll , vll > > Gr_B ;

ll A_ans[maxk] ;
vector < vll > pref_max , suf_max ;
vll or_pref ;

void pre_compute(){
    cin >> N >> M >> K ;
    or_pref.assign(N+8,0) ; 
    pref_max.assign(N+7 , vll(M+7,-1e18) ) ; 
    suf_max.assign(N+7 , vll(M+7,-1e18) ) ;
    
    vll toso ;
    for(int i=1;i<=N;i++){
        vll temp ;
        bool rosn = 1 ; ll pre = -5 , sum = 0 ;
        for(int j=1;j<=M;j++){
            ll a ; cin >> a ; 
            if( a < pre ){
                rosn = 0 ;
            }
            pre = a ;
            sum += a ;
            temp.push_back( a ) ;
        }
        
        if(rosn) Gr_B.push_back( { sum , temp } ) ;
        else{
            for(auto x : temp ){
                toso.push_back( x ) ;
            }
        }
    }
    sort( all(Gr_B) ) ; reverse( all(Gr_B) ) ;
    sort( all(toso) ) ; reverse( all(toso) ) ;
    
    for(int i=0; i<=K; i++) A_ans[i] = -1e18; 
    A_ans[0] = 0;
    
    ll tsumA = 0 ;
    for(int i=0;i<sz(toso);i++){
        tsumA += toso[i] ;
        if(i+1 <= K) A_ans[i+1] = tsumA ;
    }
    
    int tsz = sz(Gr_B) ;
    
    for(int i=0;i<tsz;i++){
        ll sum = 0 ;
        for(int j=0;j<M;j++){
            sum += Gr_B[i].nd[j] ;
            ll tres = sum - Gr_B[i].st ;
            pref_max[i][j] = tres ;
            if(i!=0){
                pref_max[i][j] = max( pref_max[i-1][j] , pref_max[i][j] ) ;
            }
        } 
    }
    
    for(int i=tsz-1;i>=0;i--){
        ll sum = 0;
        for(int j=0;j<M;j++){
            sum += Gr_B[i].nd[j] ;
            ll tres = sum ;
            suf_max[i][j] = tres ;
            if(i!=tsz-1){
                suf_max[i][j] = max( suf_max[i+1][j] , suf_max[i][j] ) ;
            }
        } 
    }
    
    ll zm_sum = 0 ;
    for(int i=0;i<tsz;i++){
        zm_sum += Gr_B[i].st ;
        or_pref[i] = zm_sum ;
    }
}

ll typB(int strona ){
    if (strona == 0) return 0;
    
    int ile = strona / M ;
    int reszta = strona % M ;
    ile -- ; reszta -- ; 
    
    int tsz = sz(Gr_B);
    if (ile >= tsz) return-1e18;
    if (ile == tsz - 1 && reszta >= 0) return -1e18;
    ll res1 = -1e18 ,res2 = -1e18; 
    ll temp1 = 0;
    if(ile >= 0 ){
        temp1 += or_pref[ile] ;
    }
    if( reszta >= 0 ){
        if(ile + 1 < tsz) {
            temp1 += suf_max[ile+1][reszta] ;
            res1 = temp1;
        }
    } else { res1 = temp1;
    }
    
    ll temp2 =0;
    if(ile + 1 < tsz){
        temp2 += or_pref[ile+1] ;
        if( reszta >= 0 ){
            temp2 += pref_max[ile+1][reszta] ;
            res2 = temp2;
        }
    }
    
    return max( res1 , res2 ) ;
}
ll solve(int strona){
    int potrzebaA = K - strona;
    if (potrzebaA < 0 || potrzebaA > K) return -1e18;
    ll ans = A_ans[potrzebaA] ;
    ll pB = typB(strona);
    
    if (ans <= -1e17 || pB <= -1e17) return -1e18;
    return ans+pB ;
}

int main(){
    ios_base::sync_with_stdio(false) ; cin.tie(0) ;
    pre_compute() ;
    ll bans = 0 ; 
    for(int i=0;i<=K;i++){
        ll res =solve(i) ;
        bans= max( bans , res ) ;
    }
    
    cout <<bans << '\n' ;
    
    return 0 ;
}