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

using namespace std;

#define ll long long

#define endl "\n"

struct ss {
  ll sum, sec;
  int pile;
  ss(ll a, ll b, int c) : sum(a), sec(b), pile(c) {}

  friend bool operator<(const ss& fst, const ss& snd) {
    return (fst.sum + snd.sec < snd.sum + fst.sec) || (fst.sec == fst.sum && fst.sum < snd.sum);
  }
};

void solve() {
  struct stakk {
    bool inc;
    vector<ll> v;  // last is first
  };

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

  vector<stakk> in;

  for(int i = 0; i < n;i++) {
    int inc = 0;
    vector<ll> panck;
    for(int j = 0 ;j < m; j++) {
      ll a;
      cin >> a;
      panck.push_back(a);
      if(j > 0 && inc == 0) {
        if(panck[j] < panck[j-1]) inc = 1;
        else if(panck[j] > panck[j-1]) inc = -1;
      }
    }
    in.push_back({inc != -1, panck});
  }

  vector<ll> max_inc(k + 1);
  max_inc[0] = 0;

  priority_queue<tuple<ll, int, int>> q; // val, from which pile, on which pos in v
  for(int i = 0; i < n; i++) {
    if(in[i].inc) q.emplace(in[i].v[0], i, 0);
  }

  int counter = 0;
  while(!q.empty() && counter < k) {
    counter ++;
    auto [val, pile, pos] = q.top(); q.pop();
    max_inc[counter] = max_inc[counter - 1] + val;
    if(pos != m-1) {
      q.emplace(in[pile].v[pos + 1], pile, pos + 1);
    }
  }
  while(counter < k) {
    counter ++;
    max_inc[counter] = max_inc[counter - 1];
  }

  vector<ll> max_dcr(k + 1);
  max_dcr[0] = 0;
  vector<ll> whole_sums(m + 1);

  priority_queue<pair<ll, int>> q_decs_half[m+1];

  priority_queue<ss> q_decs_full[m+1];  // best choice if we have 1 <= k <(!!!) m
  vector<vector<bool>> used(m+1, vector<bool>(n, false)); // for each m best used

  int decs_count = 0;

  for(int i = 0; i < n; i++) {
    if(!in[i].inc) {
      decs_count ++;
      for(int j = 1; j <= m - 1; j++) in[i].v[j] += in[i].v[j-1];
      for(int j = 0; j <= m - 1; j++) {
        q_decs_half[j+1].emplace(in[i].v[j], i);
        q_decs_full[j+1].emplace(in[i].v[m-1], in[i].v[j], i);
      }
    }
  }

  int i;
  for(i = 1; i <= k && i <= m*decs_count; i++) {
    int previous_whole = (i-1) / m * m;
    int rest = i - previous_whole;

    if(rest != m) {
      while(true) {
        auto [val, pile] = q_decs_half[rest].top();
        if(used[rest][pile]) {
          q_decs_half[rest].pop();
        } else {
          max_dcr[i] = val + whole_sums[rest];
          break;
        }
      }
    } else {
      for(int pos = 1; pos <= m; pos++) {
        auto& q_full = q_decs_full[pos];
        ss top = q_full.top();
        q_full.pop();

        whole_sums[pos] += top.sum;
        used[pos][top.pile] = true;
      }

      max_dcr[i] = whole_sums[m];
    }
  }

  for(; i <= k;i++) {
    max_dcr[i] = max_dcr[i-1];
  }


  ll ans  = 0;
  for(i = 0; i <= k; i++) {
    ans = max(ans, max_inc[i] + max_dcr[k-i]);
  }

  cout << ans << endl;

}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int t = 1;
  //cin >> t;
  while (t--) {
    solve();
  }
}