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
#include <bits/stdc++.h>
#define int LL
using namespace std;
#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define LD long double
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define endl '\n'
#define ALL(c) (c).begin(), (c).end()
#define SIZ(c) (int)(c).size()
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i)
#define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i)
#define ll LL
#define st f
#define nd s
#define pb PB
#define mp MP
#define eb emplace_back
#define siz(c) SIZ(c)
const int inf = 1e9+7;
const ll INF = 1e18L+7;

#define sim template<class n
sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
sim> auto operator << (ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type 
{int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << endl;}
sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
sim, class s> void mini(n &p, s y) {if(p>y) p = y;}
sim, class s> void maxi(n &p, s y) {if(p<y) p = y;}
#ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
#else
#define debug(...)
#endif 

#define I(x) #x " =", (x), " "
#define A(a, i) #a "[" #i " =", i, "] =", a[i], " "

vector<pair<int, VI>> increasing;
int32_t main()
{
    ios_base::sync_with_stdio(0);
    int n, m, k;
    cin >> n >> m >> k;
    VI any;

    FOR(i, 1, n) {
        VI V;
        bool decresing = 1;
        LL sum = 0;
        FOR(j, 1, m) {
            int x;
            cin >> x;
            if(j > 1 && V.back() < x)decresing = 0;
            V.PB(x);
            sum += x;
        }
        if(decresing)for(auto i: V)any.PB(i);
        else increasing.push_back(MP(sum, V));
    }
    sort(ALL(increasing));
    reverse(ALL(increasing));

    sort(ALL(any));
    reverse(ALL(any));
    FOR(i, 1, SIZ(any) - 1) {
        any[i] += any[i-1];
    }

    FORD(i, SIZ(increasing) - 1, 0) {
        REP(j, SIZ(increasing[i].s)) {
            if(j > 0)increasing[i].s[j] += increasing[i].s[j-1];
        }
        if(i + 1 != SIZ(increasing)) {
            REP(j, SIZ(increasing[i].s)) {
                maxi(increasing[i].s[j], increasing[i+1].s[j]);
            }
        }
    }
    auto from_any = [&](int k) {
        if(k == 0)return (int)0;
        if(k > SIZ(any) || k < 0)return (int)-1e18;
        return any[k-1];
    };

    LL res = from_any(k);
    // we take: prefix of full rows from increasing, then some number of guys from one row of increasing, and rest from any
    LL prefix = 0;
    FOR(i, 0, SIZ(increasing) - 1) {
        REP(j, m) {
            int taken = i * m + j + 1;
            maxi(res, increasing[i].s[j] + from_any(k - taken) + prefix);
        } 
        prefix += increasing[i].f;
    }
    cout << res << endl;

}