#include<bits/stdc++.h>
#define pii pair<int,int>
using namespace std;

typedef long long ll;
#ifdef ONLINE_JUDGE
#define getchar getchar_unlocked
#endif
namespace FastIO
{
	char write_cache[40];
	template <class T>
	inline const T read() noexcept
	{
		T x(0);
		char ch(getchar());
		bool f(0);
		while (ch < '0' || ch > '9')
			f ^= ch == '-', ch = getchar();
		while (ch >= '0' && ch <= '9')
			x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
		return f ? -x : x;
	}
	template <class T>
	inline const void read(T &x) noexcept
	{
		x = 0;
		char ch(getchar());
		bool f(0);
		while (ch < '0' || ch > '9')
			f ^= ch == '-', ch = getchar();
		while (ch >= '0' && ch <= '9')
			x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
		x = f ? -x : x;
	}
	template <class T, class... P>
	inline const void read(T &x, P &...ark) noexcept
	{
		x = 0;
		char ch(getchar());
		bool f(0);
		while (ch < '0' || ch > '9')
			f ^= ch == '-', ch = getchar();
		while (ch >= '0' && ch <= '9')
			x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
		x = f ? -x : x;
		read(ark...);
	}
	template <class T>
	inline const void readu(T &x) noexcept
	{
		x = 0;
		char ch(getchar());
		bool f(0);
		while (ch < '0' || ch > '9')
			ch = getchar();
		while (ch >= '0' && ch <= '9')
			x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
	}
	template <class T>
	inline const T readu() noexcept
	{
		T x(0);
		char ch(getchar());
		bool f(0);
		while (ch < '0' || ch > '9')
			ch = getchar();
		while (ch >= '0' && ch <= '9')
			x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
		return x;
	}
	template <class T, class... P>
	inline const void readu(T &x, P &...ark) noexcept
	{
		x = 0;
		char ch(getchar());
		bool f(0);
		while (ch < '0' || ch > '9')
			ch = getchar();
		while (ch >= '0' && ch <= '9')
			x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
		readu(ark...);
	}
	template <class T>
	inline const void readArr(T *begin, T *end) noexcept
	{
		while (begin < end)
		{
			*begin = 0;
			char ch(getchar());
			bool f(0);
			while (ch < '0' || ch > '9')
				f ^= ch == '-', ch = getchar();
			while (ch >= '0' && ch <= '9')
				*begin = (*begin << 1) + (*begin << 3) + (ch ^ 48), ch = getchar();
			*begin = f ? -*begin : *begin;
		}
	}
	template <class T>
	inline const void readArr(T *begin, int cnt) noexcept
	{
		while (cnt--)
		{
			read(*begin);
			++begin;
		}
	}
	template <class T>
	inline const void write(T x) noexcept
	{
		if (x < 0)
			putchar('-'), x = -x;
		int cnt = 0;
		while (x)
			write_cache[cnt++] = x % 10 ^ 48, x /= 10;
		if (!cnt)
			putchar('0');
		else
			while (cnt--)
				putchar(write_cache[cnt]);
	}
	template <char end = ' ', class T, class... ARK>
	inline const void write(T &x, ARK &...ark) noexcept
	{
		write(x);
		putchar(end);
		write(ark...);
	}
	template <char end = '\n', class T>
	inline const void println(T x) noexcept
	{
		if (x < 0)
			putchar('-'), x = -x;
		int cnt = 0;
		while (x)
			write_cache[cnt++] = x % 10 ^ 48, x /= 10;
		if (!cnt)
			putchar('0');
		else
			while (cnt--)
				putchar(write_cache[cnt]);
		putchar(end);
	}
	template <char sep = ' ', char endl = '\n', class T>
	inline const void writeArr(T *begin, T *end) noexcept
	{
		while (begin < end)
			write(*begin), putchar(sep), ++begin;
		putchar(endl);
	}
	template <char sep = ' ', char end = '\n', class T>
	inline const void writeArr(T *arr, int cnt)
	{
		while (cnt--)
		{
			write(*arr);
			putchar(sep);
			++arr;
		}
		putchar(end);
	}
}


const int Max=5005;
int A,B,N;
struct Stack{
	pii p[Max];
	int last,head,type,np;
	void add(int num)
	{
		np++;
		while(np-p[last].second>=N)
			last++;
		while(last<=head and p[head].first<num*type)
			head--;
		p[++head]=make_pair(num*type,np);
	}
	int qt()
	{
		return p[last].first;
	}
	void clear()
	{
		head=0;last=1;
		np=0;
	}
};
Stack s[Max][2],in[2];
int p[Max][Max],Mx[Max][Max];

int read()
{
	char c=getchar();
	int w=0;
	while(!isdigit(c))
		c=getchar();
	while(isdigit(c))
	{
		w=w*10+c-'0';
		c=getchar();
	}
	return w;
}
int ans=0x7fffffff;
signed main()
{
	
	FastIO::read(A,B,N);
	for(int i=1;i<=A;i++)
	{
		for(int j=1;j<=B;j++)
		{
			FastIO::read(p[i][j]);
		}
	}
	for(int i=1;i<=A;i++)
	{
		s[i][0].type=-1;
		s[i][1].type=1;
		s[i][0].clear();
		s[i][1].clear();
	}
	in[0].clear();
	in[1].clear();
	in[0].type=-1;
	in[1].type=1;
	for(int i=1;i<=B;i++)
	{
		for(int j=1;j<=A;j++)
		{
			s[j][0].add(p[j][i]);
			s[j][1].add(p[j][i]);
			in[0].add(-s[j][0].qt());
			in[1].add(s[j][1].qt());
			if(i>=N and j>=N)
				ans=min(ans,in[1].qt()+in[0].qt());
		}
		in[0].clear();in[1].clear();
	}
	printf("%d",ans);
}