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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define fr(i, a, b) for (ll i = (a); i <= (b); i++)
#define per(i, n) for (ll i = (n); i > 0; i--)
#define pr(i, a, b) for (ll i = (a); i >= (b); i--)
#define sz(x) ((int)x.size())
#define pb push_back
#define st first
#define nd second
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz(x) ((x)==0 ? 32 : __builtin_clz(x))
#define clzll(x) ((x)==0 ? 64 : __builtin_clzll(x))
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\n'
#define debug2(x, y) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << '\n'
#define debug3(x, y, z) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << ',' << #z << ':' << (z) << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
template<class T> using P = pair<T, T>;
template<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>;
template<class T> using pri_b = priority_queue<T>;
template <class T> using sds=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
constexpr int inf = 1000000010;
constexpr int inf2 = 2000000010;
constexpr ll INF = 1000000000000000010; // 1e18 + 10
constexpr ll INF4 = 4000000000000000010; // 4e18 + 10
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1,0 }; int dy[] = { 0,1,0,-1,1,-1,1,-1,0 };
ll mul(ll a, ll b) { return (b != 0 && a > INF / b ? INF : a * b); }
// void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
// template<class T> void er(T a) { cout << a << '\n'; exit(0); }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T> istream& operator >>(istream& s, vector<T>& v) { for (auto& e : v) s >> e; return s; }
template<class T, class U> istream& operator >>(istream& s, pair<T, U>& p) { s >> p.first >> p.second; return s; }
template<class T> ostream& operator <<(ostream& s, const vector<T>& v) { for (auto& e : v) s << e << ' '; return s; }
template<class T, class U> ostream& operator << (ostream& s, const pair<T, U>& p) { s << p.first << ' ' << p.second; return s; }
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); 
 
constexpr ll mod = mod1e9;
template <int mod> class modint {
public:
    int n;
    modint() : n(0) {};
    modint(ll n_) {
        n = n_ % mod;
        if (n < 0) n += mod;
    }
    modint operator -() const { return n > 0 ? mod - n : -n; }
    bool operator == (const modint& m) const { return n == m.n; }
    bool operator != (const modint& m) const { return n != m.n; }
    modint& operator += (const modint& m) { n += m.n; if (n >= mod) n -= mod; return *this; }
    modint& operator -= (const modint& m) { n -= m.n; if (n < 0) n += mod; return *this; }
    modint& operator *= (const modint& m) { n = ll(n) * m.n % mod; return *this; }
    modint& operator /= (const modint& m) { n = ll(n) * modinv(m).n % mod; return *this; }
    modint operator +(modint m) const { return modint(*this) += m; }
    modint operator -(modint m) const { return modint(*this) -= m; }
    modint operator *(modint m) const { return modint(*this) *= m; }
    modint operator /(modint m) const { return modint(*this) /= m; }
    modint& operator ++ () { *this += 1; return *this; }
    modint operator ++ (int) { *this += 1; return *this - 1; }
    modint& operator -- () { *this -= 1; return *this; }
    modint operator -- (int) { *this -= 1; return *this + 1; }
    modint pow(ll b) const {
        modint res = 1, a = modint(*this);
        while (b) {
            if (b & 1) res *= a;
            a *= a;
            b >>= 1;
        }
        return res;
    }
    friend istream& operator >> (istream& s, modint<mod>& a) { s >> a.n; return s; }
    friend ostream& operator << (ostream& s, modint<mod>& a) { s << a.n; return s; }
};
 
using mint = modint<mod>;
ostream& operator <<(ostream& s, const vector<mint>& v) { for (auto& e : v) s << e.n << ' '; return s; }
 
mint modinv(mint x) {
    ll a = x.n;
    if (a == 0) abort();
    ll b = mod, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    mint res = u;
    return res;
}

vector<mint> fac, inv, facinv;
 
void modcalc(int n) {
    fac.resize(n); inv.resize(n); facinv.resize(n);
    fac[0] = 1; fac[1] = 1; inv[1] = 1;
    facinv[0] = 1; facinv[1] = 1;
    for (ll i = 2; i < n; i++) {
        fac[i] = fac[i - 1] * i;
        inv[i] = -inv[mod % i] * (mod / i);
        facinv[i] = facinv[i - 1] * inv[i];
    }
}
 
mint comb(ll n, ll k) {
    if (n < 0 || k < 0 || n < k) return 0;
    return fac[n] * facinv[k] * facinv[n - k];
}
 
mint perm(ll n, ll k) {
    if (n < 0 || k < 0 || n < k) return 0;
    return fac[n] * facinv[n - k];
}

ll floor_div(ll x, ll y) {
    assert(y != 0);
    if (y < 0) {
        y = -y;
        x = -x;
    }
    if (x >= 0) return x / y;
    return (x + 1) / y - 1;
}
ll ceil_div(ll x, ll y) {
    assert(y != 0);
    if (y < 0) {
        y = -y;
        x = -x;
    }
    if (x <= 0) return x / y;
    return (x - 1) / y + 1;
}

#define pi P<int>
#define vi vector<int>
#define vpi vector<P<int>>
#define vvi vector<vi>
#define vvpi vector<vpi>

#define int ll

// ======================================================================================================================
// ======================================================================================================================
// ======================================================================================================================

int n,m,k;

vi calc(vpi v){
    sort(all(v), greater<pi>());
    vi pref(n+1, 0);
    vi msuf(n+1, 0);
    fr(i, 1, n){
        pref[i] = pref[i-1] + v[i-1].st;
    }
    pr(i, n-1, 0){
        msuf[i] = max(msuf[i+1], v[i].nd);
    }
    vi res(n, 0);
    int curr = -INF;
    rep(i, n){
        pi c = v[i];
        res[i] = max(msuf[i] + pref[i], curr + pref[i+1]);
        chmax(curr, c.nd-c.st);
    }
    return res;
}

void solve(){
    cin>>n>>m>>k;
    vvi ros, mal;
    rep(i, n){
        vector<int> v(m);
        cin>>v;
        if (v[0] < v.back()) ros.pb(v);
        else mal.pb(v);
    }
    vi wmal = {0};
    vi wsk(sz(mal), 0);
    pri_b<P<int>> kol;
    rep(i, sz(mal)){
        kol.push({mal[i][0], i});
    }
    while (!kol.empty()){
        pi s = kol.top();
        kol.pop();
        wsk[s.nd]++;
        if (wsk[s.nd] < m) kol.push({mal[s.nd][wsk[s.nd]], s.nd});
        wmal.pb(wmal.back()+s.st);
    }
    n = sz(ros);
    vi wros(n*m+1, 0);
    vpi v(n, {0, 0});
    rep(i, sz(ros)){
        for (auto j : ros[i]) v[i].st += j;
    }
    fr(i, 1, m-1){
        rep(j, sz(ros)){
            v[j].nd += ros[j][i-1];
        }
        vi cres = calc(v);
        rep(j, n){
            wros[i+j*m] = cres[j];
        }
    }
    sort(all(v), greater<pi>());
    fr(i, 1, n) wros[i*m] = wros[(i-1)*m] + v[i-1].st;
    // cout<<wmal<<"\n"<<wros<<"\n";
    int res = 0;
    fr(i, 0, k){
        if (i > sz(mal)*m || k-i > n*m) continue;
        chmax(res, wmal[i]+wros[k-i]);
    }
    cout<<res<<"\n";
}

int32_t main()
{
    std::cin.tie(nullptr); std::cout.tie(nullptr); std::ios_base::sync_with_stdio(0);
    int abctest=1;
    // cin>>abctest;
    while (abctest--){
        solve();
    }
    return 0;
}