#include <bits/stdc++.h>

using namespace std;

#define int long long
constexpr int MAXN=3e3+10, N=1e5+10;
int n, m, k;
int a[MAXN][MAXN], s[MAXN][MAXN];
int mx, sum, now; 
vector<pair<int,int>> v[N];

multiset<pair<int,int>> st;

void work(int x, int l, int r, int t) {
    if (x>n) return;
    if (t==1) st.insert({l,r});
    int L=0, R=m+1;
    auto it=st.lower_bound({l,r});
    if (it!=st.begin()) L=prev(it)->second;
    if (next(it)!=st.end()) R=next(it)->first;
    L++, R--;
    L=max(L,l); R=min(R,r);
    if (L<=R) s[x][L]+=t, s[x][R+1]-=t;
    if (t==-1) st.erase(it);
}

void work(vector<pair<int,int>>& v) {
    int i=0, j=0;
    while(i<size(v)&&j<size(v)) {
        auto x1=v[i].first, x2=v[j].first+k;
        if (x1<=x2) work(x1,v[i].second,v[i].second+k-1,1), i++;
        if (x2<=x1) work(x2,v[j].second,v[j].second+k-1,-1), j++;
    }
    while (j<size(v)) work(v[j].first+k,v[j].second,v[j].second+k-1,-1), j++;
    st.clear();
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin>>n>>m>>k;
    for (int i=1; i<=n; ++i) for (int j=1; j<=m; ++j) cin>>a[i][j], v[a[i][j]].push_back({i,j});
    for (int i=1; i<=1e5; ++i) if (v[i].size()) work(v[i]);
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=m; ++j)
            s[i][j]+=s[i][j-1];
        for (int j=1; j<=m; ++j)
            s[i][j]+=s[i-1][j];
    }
    for (int i=k; i<=n; ++i) for (int j=k; j<=m; ++j) sum+=s[i][j], mx=max(mx,s[i][j]);
    cout<<mx<<' '<<sum<<'\n';
}