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
#include<bits/stdc++.h>
bool Mbg;
using namespace std;
#define vec vector
#define pb push_back
#define eb emplace_back
#define SZ(vec) (int)((vec).size())
#define all(vec) (vec).begin(),(vec).end()
#define pii pair<int,int>
#define x first
#define y second
#define mp make_pair
#define exc(expr) if(expr)continue;
#define stop(expr) if(expr)break;
#define ret(expr) if(expr)return;
#define deb(var) std::cerr<<#var<<'='<<(var)<<"; "
#define debl(var) std::cerr<<#var<<'='<<(var)<<";\n"
#define debs(...) std::cerr << "(" << #__VA_ARGS__ << ")=(", deb_out(__VA_ARGS__)
void deb_out() { cerr<<");\n"; }
template <typename H>void deb_out(H h) { std::cerr << h << ");\n"; }
template <typename H, typename...T>void deb_out(H h, T... t){ std::cerr << h << ","; deb_out(t...); }
template<typename T>std::ostream& operator <<(std::ostream& os,const vector<T>& arr){
    if(arr.empty())return os;
    os<<arr[0];
    for(int i=1;i<arr.size();i++)os<<' '<<arr[i];
    return os;
}
#define ins insert
#define era erase
#define lb lower_bound
#define ub upper_bound
#define int long long
#define inf (long long)(1.1e18)
template<typename T>bool Min(T &x,const T &y){return x>y?x=y,1:0;}
template<typename T>bool Max(T &x,const T &y){return x<y?x=y,1:0;}
const int mod=998244353;
void Add(int &x,const int &y){x=x+y<mod?x+y:x+y-mod;}
void Dec(int &x,const int &y){x=x>=y?x-y:x-y+mod;}
int fpm(int x,int y){
    int ans=1;for(;y;y>>=1,x=1ll*x*x%mod)if(y&1)ans=1ll*x*ans%mod;return ans;
}

int n,m,k,val[300010];
vec<int> a[300010],b;
void work(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        a[i].resize(m);
        for(auto &x:a[i])cin>>x;
        if(is_sorted(all(a[i]))){
            for(int j=1;j<m;j++)a[i][j]+=a[i][j-1];
        }else{
            for(auto x:a[i])b.eb(x);
            a[i].clear();
        }
    }
    sort(all(b),greater<int>());
    vec<int> ps(SZ(b)+1);
    for(int i=1;i<=SZ(b);i++){
        ps[i]=ps[i-1]+b[i-1];
    }
    int res=0;
    for(int r=1;r<=m;r++){
        vec<pii> S;
        for(int i=1;i<=n;i++){
            exc(a[i].empty());
            S.eb(a[i].back(),i);
            val[i]=a[i][r-1];
        }
        sort(all(S),greater<pii>());
        int s=0,mxdelta=-inf;
        vec<int> mxsuf(SZ(S)+1);
        for(int i=SZ(S)-1;~i;i--){
            mxsuf[i]=max(mxsuf[i+1],val[S[i].y]);
        }
        for(int i=0;i<SZ(S);i++){
            // 选了i个完整的
            if(i)s+=S[i-1].x,Max(mxdelta,val[S[i-1].y]-S[i-1].x);
            
            int ans=max(S[i].x+mxdelta,mxsuf[i])+s;
            int k2=i*m+r;
            if(k2<=k){
                ans+=ps[min(SZ(b),k-k2)];
                Max(res,ans);
            }
        }
    }
    if(SZ(b)<=k)Max(res,ps.back());
    cout<<res<<'\n';
}
bool Med;
signed main(){
    ios::sync_with_stdio(0),
    cin.tie(0),cout.tie(0);
    int T=1;while(T--)work();
    // cerr<<"Time: "<<clock()<<" ms;\n";
    // cerr<<"Memory: "<<abs(&Med-&Mbg)/1024.0/1024.0<<" MiB.\n";
}
/*
- CONTINUE, NON-STOPPING, FOR THE FAITH
- START TYPING IF YOU DON'T KNOW WHAT TO DO
- STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
*/