#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 1010;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, m, k;
int a[N][N];
int g[N][N], f[N][N], minn[N][N], maxn[N][N];
int que[N * N], hh = 0, tt = -1;
    // f[i][j] = \max { f[i][j], f[i + 1][j] ... f[i + r - 1][j] }
    // ans[i][j] = \max { ans[i][j], ans[i][j + 1], ans[i][j + 2] ... ans[i][j + c - 1]; }

signed main()
{
    read(n, m, k);
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= m; j ++) read(a[i][j]);
    
    
    for (int j = 1; j <= m; j ++)
    {
        hh = 0, tt = -1;
        for (int i = 1; i <= n; i ++)
        {
            while (hh <= tt && i - que[hh] >= k) hh ++;
            while (hh <= tt && a[que[tt]][j] <= a[i][j]) tt --;
            que[++ tt] = i;
            if (i >= k) f[i - k + 1][j] = a[que[hh]][j];
        }
    }
    for (int j = 1; j <= m; j ++)
    {
        hh = 0, tt = -1;
        for (int i = 1; i <= n; i ++)
        {
            while (hh <= tt && i - que[hh] >= k) hh ++;
            while (hh <= tt && a[que[tt]][j] >= a[i][j]) tt --;
            que[++ tt] = i;
            if (i >= k) g[i - k + 1][j] = a[que[hh]][j];
        }
    }

    for (int i = 1; i <= n; i ++)
    {
        hh = 0, tt = -1;
        for (int j = 1; j <= m; j ++)
        {
            while (hh <= tt && j - que[hh] >= k) hh ++;
            while (hh <= tt && f[i][que[tt]] <= f[i][j]) tt --;
            que[++ tt] = j;
            if (j >= k) maxn[i][j - k + 1] = f[i][que[hh]];
        }
    }
    for (int i = 1; i <= n; i ++)
    {
        hh = 0, tt = -1;
        for (int j = 1; j <= m; j ++)
        {
            while (hh <= tt && j - que[hh] >= k) hh ++;
            while (hh <= tt && g[i][que[tt]] >= g[i][j]) tt --;
            que[++ tt] = j;
            if (j >= k) minn[i][j - k + 1] = g[i][que[hh]];
        }
    }
    
    int ans = INF;
    for (int i = 1; i <= n - k + 1; i ++)
        for (int j = 1; j <= m - k + 1; j ++)
            ans = min(ans, maxn[i][j] - minn[i][j]);
    cout << ans << '\n';
    
    return 0;
}