#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a >= b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


struct UnionFind {
    vector<int> par;
    vector<int> edge;
    
    UnionFind(int n) : par(n, -1),edge(n, 0) {}

    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) {
            edge[x]++;
            return false;
        }
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        edge[x] += edge[y]+1;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
};

int main(){
    ll h,w;cin >> h >> w;
    ll n,d;cin >> n >> d;
    vvl g(h,vl(w));
    rep(i,n){
        ll x,y;cin >> x >> y;x--;y--;
        g[x][y]++;
    }
    UnionFind uf(h*w);
    rep(i,h){
        rep(j,w){
            if(g[i][j]==0)continue;
            for(ll k=-d;k<=d;k++){
                for(ll l=-d;l<=d;l++){
                    if(abs(k)+abs(l)>d)continue;
                    if(i+k<0||i+k>=h||j+l<0||j+l>=w)continue;
                    if(g[i+k][j+l])uf.merge(i*w+j,(i+k)*w+j+l);
                }
            }
        }
    }
    ll cmp=0;
    rep(i,h)rep(j,w){
        if(uf.root(i*w+j)!=i*w+j)continue;
        //if(g[i][j]==0)continue;
        if(uf.size(i*w+j)>=2)cmp++;
    }
    ll lx=INF,rx=-INF;
    rep(i,h){
        rep(j,w){
            if(g[i][j])continue;
            set<ll> st;
            for(ll k=-d;k<=d;k++){
                for(ll l=-d;l<=d;l++){
                    if(abs(k)+abs(l)>d)continue;
                    if(i+k<0||i+k>=h||j+l<0||j+l>=w)continue;
                    if(g[i+k][j+l])st.insert(uf.root((i+k)*w+j+l));
                }
            }
            if(st.size()==0){
                chmin(lx,cmp);chmax(rx,cmp);
            }
            else {
                ll ret=1;
                for(auto p:st)if(uf.size(p)>=2)ret--;
                chmin(lx,cmp+ret);chmax(rx,cmp+ret);
            }
        }
    }
    cout << lx <<" " << rx << endl;
}