/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author majk
*/
#ifndef MAJK_LIB
#define MAJK_LIB
#include <vector>
#include <stack>
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <array>
#include <bitset>
#include "tickets.h"
using namespace std;
#define x first
#define y second
typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;
template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
ui logceil(ll x) { return x?8*sizeof(ll)-__builtin_clzll(x):0; }
namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename F> double bsld(double l,double h,const F&f){ui r=200;while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }
template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};
#endif
ll find_maximum(int K, vector<vector<int>> A) {
int N = A.size(), M = A[0].size();
vector<vector<int>> B = A;
ll tot = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < K; ++j) {
tot += A[i][j+M-K];
B[i][j] += B[i][j+M-K];
}
}
// cout << N*K/2 << endl;
vector2<pair<ll, int>> D(N+1, N*K/2+1, {ll(1e18), 0});
D[0][0] = {0LL, 0};
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= N*K; ++j) {
ll a = 0;
D[i+1][j] = min(D[i+1][j], {D[i][j].x, 0});
for (int k = 0; k < K; ++k) {
a += B[i][k];
if (j+k+1 <= N*K/2) {
D[i + 1][j + k + 1] = min(D[i + 1][j + k + 1], {D[i][j].x + a, k + 1});
}
}
}
}
int cur = N/2*K;
vector<int> CntLo(N), CntHi(N);
for (int i = N-1; i >= 0; --i) {
CntLo[i] = D[i+1][cur].y;
CntHi[i] = K - CntLo[i];
cur -= D[i+1][cur].y;
}
vector2<int> T(N, M, -1);
for (int i = 0; i < K; ++i) {
int lo = N/2, hi = N/2;
for (int j = 0; j < N; ++j) {
if (CntLo[j] == 0) hi--;
if (CntLo[j] == K-i) lo--;
}
for (int j = 0; j < N; ++j) {
if (CntLo[j] == 0) {
T[j][M-CntHi[j]] = i;
--CntHi[j];
} else if (CntLo[j] == K-i) {
--CntLo[j];
T[j][CntLo[j]] = i;
} else if (lo > 0) {
--CntLo[j];
--lo;
T[j][CntLo[j]] = i;
} else {
T[j][M-CntHi[j]] = i;
--CntHi[j];
--hi;
}
}
}
allocate_tickets(T);
return tot - D[N][N*K/2].x;
}
class tickets {
public:
void solve(istream& cin, ostream& cout) {
int N, M, K; cin >> N >> M >> K;
vector2<int> A(N, M); cin >> A;
cout << find_maximum(K, A) << endl;
// cout << tot << endl;
// cout << D[N][N*K].x << endl;
// cout << tot - D[N][N*K/2].x << '\n';
// cout << T;
}
};
