#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

const pid_t pid = getpid();

//Appropriately Changed
using W = ll;
using edge = struct {int to, rev; W cap, flow;};
using G = vector<vector<edge>>;
 
#define error(args...) { vector<string> _debug = split(#args, ',');err(begin(_debug), args);}

vector<string> split(const string& s, char c){
	vector<string> v;stringstream ss(s);string x;
	while (getline(ss, x, c)) v.emplace_back(x);
	return move(v);
}

void err(vector<string>::iterator it) {cerr << endl;}
template<typename T, typename... Args> void err(vector<string>::iterator it, T a,Args... args){
	cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << " ",err(++it, args...);
}


//Appropriately Changed
void add_edge(G &graph, int from, int to, W cap) {
	// error(from, to, cap);
	graph[from].push_back({to, int(graph[to].size()) , cap , 0});
	graph[to].push_back({from, int(graph[from].size()) - 1, 0 , 0});
}

W dinic(G &graph, int s, int t) {
	const W inf = 1LL << 50;
	const int n = graph.size();
	vector<int> level(n), iter(n);

	auto bfs = [&](int s, int t) {
		fill(begin(level), end(level), -1);
		queue<int> q;
		level[s] = 0, q.push(s);

		while (!q.empty()) {
			int v = q.front(); q.pop();
			for (auto &e : graph[v]) {
				if (level[e.to] == - 1 and e.cap > e.flow) {
					level[e.to] = level[v] + 1;
					q.push(e.to);
				}
			}
		}
		return (level[t] !=  -1);
	};

	auto dfs = [&](int v, int t, W f) {
		auto func = [&](int v, int t, W f, auto func)->W{

			if (v == t) return f;
			for (int &i = iter[v]; i < graph[v].size(); i++) {
				edge &e = graph[v][i];

				if (e.cap > e.flow and level[v] < level[e.to]) {

					W d = func(e.to, t, min(f, e.cap - e.flow), func);

					if (d > 0) {
						e.flow += d, graph[e.to][e.rev].flow -= d;
						return d;
					}
				}
			}

			return 0;
		};
		return func(v, t, f, func);
	};

	while (bfs(s, t)) {
		fill(begin(iter), end(iter), 0);
		while (dfs(s, t, inf) != 0 );
	}

	W ret = 0;
	for (auto &e : graph[s]) ret += e.flow;
	return ret;
}

using pii = pair<int,int>;
ll B[55][55];

int main(void){
	int h,w; ll cost;
	cin >> h >> w >> cost;

	rep(i, h) rep(j, w) cin >> B[i][j];

	vector<pii> ary;
	rep(i, h - 1)rep(j, w - 1){
		if((i + j) % 2 == 1) continue;
		ary.push_back(pii(i, j));
	}

	sort(begin(ary), end(ary));

	const int s = ary.size();
	const int t = s + 1;
	const int n = t + 1;
	G graph(n);
	ll ans = 0LL;

	rep(i, ary.size()){
		const int r = ary[i].first;
		const int c = ary[i].second;

		ll cur = 0LL;
		rep(a,2)rep(b,2) cur += B[r + a][c + b];
		ans += cur;
		

		if(r % 2 == 1){
			add_edge(graph, s, i, cur);
			add_edge(graph, i, t, cost);
		} else {
			add_edge(graph, s, i, cost);
			add_edge(graph, i, t, cur);
		}
	}

	rep(i, 1, h - 1) rep(j, 1, w - 1){
		if( (i + j) % 2 == 1) {
			const int ai = getidx(ary, pii(i - 1, j));
			const int bi = getidx(ary, pii(i, j - 1));
			if( (i - 1) % 2 == 0) {
				add_edge(graph, bi, ai, B[i][j]);
			} else {
				add_edge(graph, ai, bi, B[i][j]);
			}
		} else {
			const int ai = getidx(ary, pii(i - 1, j - 1));
			const int bi = getidx(ary, pii(i, j));
			if((i - 1) % 2 == 0) {
				add_edge(graph, bi, ai, B[i][j]);
			} else {
				add_edge(graph, ai, bi, B[i][j]);
			}
		}
	}

	const ll val = dinic(graph, s, t);
	// error(ans, val);
	ans -= val;
	cout << ans << endl;
	return 0;
}


Measured memory_bytes: 3428