#include <cstdio>
#include <iostream>
#include <set>
#define IN inline
using namespace std;

namespace IO {
    const int SIZE = (1 << 21) + 1;
    char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int ff, qr;
    #define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
    IN void flush(){fwrite (obuf, 1, oS - obuf, stdout); oS = obuf;}
    IN void putcc(char x){*oS ++ = x; if (oS == oT) flush();}
    template <class I>
    IN void read(I &x) {
        for (ff = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') ff = -1;
        for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= ff;
    }
}
using namespace IO;

typedef long long LL;
const int N = 3005, M = 1e5 + 5;
int n, m, K, a[N][N], d[N], f[N];

struct node {
	int x, y;
	IN bool operator < (const node &c) const {return y < c.y ? 1 : (y == c.y ? x > c.x : 0);}
};
set<node> S[M];
typedef set<node>::iterator IT;

int main() {
	read(n), read(m), read(K);
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= m; ++j) read(a[i][j]);
	int Mx = 0; LL sum = 0;
	for(int i = 1; i <= n; ++i) {
		if (i > K) {
			for(int j = 1; j <= m; ++j) {
				int l = j, r = min(j + K, m + 1);
				IT it = S[a[i - K][j]].lower_bound(node{i - K, j}), itt = it;
				if (it != S[a[i - K][j]].begin()) --itt, l = max(l, min((*itt).y + K, m + 1));
				++it;
				if (it != S[a[i - K][j]].end()) r = min(r, (*it).y);
				if (l < r) --d[l], ++d[r];
				S[a[i - K][j]].erase(--it);
			}
		}
		for(int j = 1; j <= m; ++j) {
			IT it = S[a[i][j]].insert(node{i, j}).first, itt = it;
			int l = j, r = min(j + K, m + 1);
			if (it != S[a[i][j]].begin()) --itt, l = max(l, min((*itt).y + K, m + 1));
			++it;
			if (it != S[a[i][j]].end()) r = min(r, (*it).y);
			if (l < r) ++d[l], --d[r];
		}
		for(int j = 1; j <= m; ++j) d[j] += d[j - 1], f[j] += d[j];
		for(int j = 1; j <= m; ++j) d[j] = 0;
		if (i >= K) for(int j = K; j <= m; ++j) Mx = max(Mx, f[j]), sum += f[j];
	}
	printf("%d %lld\n", Mx, sum);
}