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
#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (c it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(x...) " [" #x ": " << (x) << "] "

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
template <typename A, typename B>
using unordered_map2 = __gnu_pbds::gp_hash_table<A, B>;
using namespace __gnu_pbds;
template <typename T> using ordered_set =
  __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag,
                   __gnu_pbds::tree_order_statistics_node_update>;
// ordered_set<int> s; s.insert(1); s.insert(2);
// s.order_of_key(1);    // Out: 0.
// *s.find_by_order(1);  // Out: 2.

using ld = long double;
using ll = long long;

constexpr int mod = 1000 * 1000 * 1000 + 7;
constexpr int odw2 = (mod + 1) / 2;

void OdejmijOd(int& a, int b) { a -= b; if (a < 0) a += mod; }
int Odejmij(int a, int b) { OdejmijOd(a, b); return a; }
void DodajDo(int& a, int b) { a += b; if (a >= mod) a -= mod; }
int Dodaj(int a, int b) { DodajDo(a, b); return a; }
int Mnoz(int a, int b) { return (ll) a * b % mod; }
void MnozDo(int& a, int b) { a = Mnoz(a, b); }
int Pot(int a, ll b) { int res = 1; while (b) { if (b % 2 == 1) MnozDo(res, a); a = Mnoz(a, a); b /= 2; } return res; }
int Odw(int a) { return Pot(a, mod - 2); }
void PodzielDo(int& a, int b) { MnozDo(a, Odw(b)); }
int Podziel(int a, int b) { return Mnoz(a, Odw(b)); }
int Moduluj(ll x) { x %= mod; if (x < 0) x += mod; return x; }

template <typename T> T Maxi(T& a, T b) { return a = max(a, b); }
template <typename T> T Mini(T& a, T b) { return a = min(a, b); }

class DataStructure {
 public:
  explicit DataStructure(int goal_count) : goal(goal_count) {}

  void Add(ll x) {
    bigger_sum += x;
    bigger.insert(x);

    if ((int) bigger.size() > goal) {
      auto it = bigger.begin();
      assert(it != bigger.end());
      const ll y = *it;
      bigger.erase(it);
      bigger_sum -= y;

      smaller.insert(y);
    }
  }

  void Remove(ll x) {
    auto it = smaller.find(x);
    if (it != smaller.end()) {
      smaller.erase(it);
      return;
    }

    auto it2 = bigger.find(x);
    assert(it2 != bigger.end());
    bigger_sum -= *it2;
    bigger.erase(it2);

    if (!smaller.empty()) {
      auto it3 = smaller.end();
      --it3;
      const ll y = *it3;
      smaller.erase(it3);

      bigger.insert(y);
      bigger_sum += y;
    }
  }

  ll SumTop(int count) {
    assert(goal == count);
    assert((int) bigger.size() == goal);
    return bigger_sum;
  }

 private:
  int goal;
  ll bigger_sum = 0;
  multiset<ll> smaller;
  multiset<ll> bigger;
};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

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

  // Increasing stacks.
  vector<vector<ll>> stacks;

  // Mixed decreasing stacks.
  vector<ll> rest;

  stacks.reserve(n);
  for (int i = 0; i < n; i++) {
    stacks.emplace_back();
    stacks.back().resize(m);

    bool is_decreasing = false;
    for (int j = 0; j < m; j++) {
      cin >> stacks.back()[j];
      if (j > 0 and stacks.back()[j] < stacks.back()[j - 1]) {
        is_decreasing = true;
      }
    }
    if (is_decreasing) {
      for (ll x : stacks.back()) {
        rest.push_back(x);
      }
      stacks.pop_back();
    }
  }

  for (auto& s : stacks) {
    assert((int) s.size() == m);
    reverse(s.begin(), s.end());
    s.push_back(0);
    for (int i = m - 1; i >= 0; i--) {
      s[i] += s[i + 1];
    }
    s.push_back(s.back());
  }

  n = (int) stacks.size();
  const int q = (int) rest.size();

  sort(rest.begin(), rest.end());
  rest.push_back(0);
  for (int i = q - 1; i >= 0; i--) {
    rest[i] += rest[i + 1];
  }
  rest.push_back(rest.back());

  ll result = 0;

  for (int bite = 0; bite < m; bite++) {
    // "bite" elements will be taken from exactly one of the increasing stacks.
    // If "x" elements are taken from the decreasing stacks and "y" full stacks
    // are taken, then:
    //   bite + x + y * m = k
    // Therefore:
    //   x = (k - bite - y * m) % m = (k - bite) % m
    //   y = (k - bite - x) / m
    const int x = (k - bite + m) % m;
    if (x + bite > k) {
      // Impossible to achieve this bite.
      continue;
    }
    assert((k - bite - x) % m == 0);
    const int y = (k - bite - x) / m;
    debug() << imie(n) imie(m) imie(q) imie(k) imie(bite) imie(x) imie(y);
    if (x > q) {
      // Not enough elements on the decreasing stack. Impossible.
      continue;
    }
    const ll remainder = rest[q - x] - rest[q];
    DataStructure ds = DataStructure(y);
    int ds_size = 0;

    // Add groups of m from decreasing stacks.
    int pos = q - x;
    while (pos >= m) {
      ds.Add(rest[pos - m] - rest[pos]);
      ds_size++;
      pos -= m;
    }

    // Add all full increasing stacks.
    for (int i = 0; i < n; i++) {
      ds.Add(stacks[i][0]);
      ds_size++;
    }

    if (bite == 0) {
      if (ds_size < y) continue;
      const ll best_y = ds.SumTop(y);
      const ll this_result = remainder + best_y;
      Maxi(result, this_result);
    } else {
      if (ds_size - 1 < y) continue;
      // For each increasing stack take only "bite" from it.
      for (int i = 0; i < n; i++) {
        ds.Remove(stacks[i][0]);
        const ll bite_sum = stacks[i][m - bite] - stacks[i][m];
        const ll best_y = ds.SumTop(y);
        const ll this_result = remainder + bite_sum + best_y;
        Maxi(result, this_result);
        ds.Add(stacks[i][0]);
      }
    }
  }

  cout << result << "\n";
  return 0;
}