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
#include "bits/stdc++.h"
using namespace std;

#define int long long
#define ll long long
#define ld long double

#define endl '\n'
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(x) begin(x),end(x)
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)

#define _$ auto operator<<(auto&o,auto x)->decltype
_$(x.st,o){return o<<"("<<x.st<<", "<<x.nd<<")";}
_$(end(x),o){o<<"{";for(int i=0;auto e:x)o<<","+!i++<<e;return o<<"}";}

#ifdef xLOCAL
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){\
  ((cerr<<$<<"; "),...)<<'\n';}(x)
#else
#define debug(...)
#endif

#define rep(i,a,b) for(int i=(a);i<(b); i++)
using pii=pair<int,int>;
using vi=vector<int>;

const int inf = 1e9+7;

signed main() {
  cin.tie(0)->sync_with_stdio(0);

  int n, m, k;
  cin >> n >> m >> k;

  vi A, B;
  vector<vi> v;
  vi sum;
  FOR(_,1,n){
    vi a(m);
    for (int &x : a) cin >> x;
    if (a[0] >= a.back()) {
      for (int x : a)
        A.pb(x);
    } else {
      a.insert(begin(a), 0);
      FOR(i,1,m) a[i] += a[i-1];
      v.pb(a);
      sum.pb(a.back());
    }
  }
  
  int ile = sz(v);
  sort(all(A));
  reverse(all(A));
  A.insert(begin(A), 0);
  while (sz(A) <= k) A.pb(0); 
  rep(i,1,sz(A)) A[i] += A[i-1];

  debug(A);
  if (sz(v) == 0) {
    cout << A[k] << '\n';
    return 0;
  }

  sort(all(v), [&](vi p, vi q) { return p.back() > q.back(); });
  sort(all(sum));
  reverse(all(sum));
  debug(sz(v));

  debug(v);
  debug(sum);

  rep(i,1,sz(sum)) sum[i] += sum[i-1];
  sum.pb(sum.back());
  sum.pb(sum.back());
  sum.pb(sum.back());

  auto w = v;
  debug(sz(v), sz(w));

  rep(i,0,sz(w)) {
    FOR(j,0,m) {
      w[i][j] -= w[i].back();
      if (i > 0) w[i][j] = max(w[i][j], w[i-1][j]);
    }
  }
  w.pb(w.back());
  w.pb(w.back());
  w.pb(w.back());

  ROF(i,sz(v)-2,0){
    FOR(j,0,m){
      v[i][j] = max(v[i][j], v[i+1][j]);
    }
  }
  v.pb(vi(m+1,0));
  v.pb(vi(m+1,0));
  v.pb(vi(m+1,0));

  debug(v, w);
  debug(sum);

  FOR(i,0,ile * m) {
    int stk = i/m;
    int res = i%m;
   
    int s = (stk==0?0:sum[stk-1]); 
    debug(i, stk, res, stk + 1, res, sz(sum), sz(v));
    debug(s, v[stk + 1][res], sum[stk + 1], w[stk][res]);
    B.pb(max(s + v[stk + 1][res],
             sum[stk] + w[stk][res]));
  }
  while(sz(B) <= k)
    B.pb(0);
 
  debug(A);
  debug(B);

  int ans = 0; 
  FOR(i,0,k){ 
    ans = max(ans, A[i] + B[k-i]);
  }

  cout << ans << '\n';
    
  return 0;
}