#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

bool isin(ll x, ll y, ll H, ll W){
    return (x >= 0 && x < H && y >= 0 && y < W);
}

int main() {
    ll H, W, N, D;
    cin >> H >> W >> N >> D;
    vector<ll> X(N);
    vector<ll> Y(N);
    rep(i, N){
        cin >> X[i] >> Y[i];
        X[i]--;
        Y[i]--;
    }
    vector<vector<bool>> has(H, vector<bool>(W, false));
    for (ll i = 0; i < N; i++){
        has[X[i]][Y[i]] = true;
    }
    dsu tree(H * W);
    for (ll i = 0; i < H; i++){
        for (ll j = 0; j < W; j++){
            if (has[i][j]){
                for (ll k = -D; k <= D; k++){
                    for (ll l = -D; l <= D; l++){
                        if (abs(k) + abs(l) <= D){
                            if (isin(i + k, j + l, H, W)){
                                if (has[i + k][j + l]){
                                    tree.merge(i * W + j, (i + k) * W + j + l);
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    vector<vector<ll>> lds(H, vector<ll>(W, -1));
    rep(i, H){
        rep(j, W){
            if (has[i][j]){
                lds[i][j] = tree.leader(i * W + j);
            }
        }
    }
    debug(lds);

    ll now_kind = 0;
    rep(i, H){
        rep(j, W){
            if (has[i][j] && tree.leader(i * W + j) == i * W + j && tree.size(i * W + j) >= 2){
                now_kind++;
            }
        }
    }
    // debug(now_kind);

    ll INF = 1000000000023LL;

    ll ans_max = now_kind;
    ll ans_min = now_kind;
    for (ll i = 0; i < H; i++){
        for (ll j = 0; j < W; j++){
            if (has[i][j]) continue;
            set<ll> st_one;
            set<ll> st_two;
            for (ll k = -D; k <= D; k++){
                for (ll l = -D; l <= D; l++){
                    if (isin(i + k, j + l, H, W)){
                        if (has[i + k][j + l]){
                            if (abs(k) + abs(l) <= D){
                                if (tree.size((i + k) * W + j + l) == 1){
                                    st_one.insert(tree.leader((i + k) * W + j + l));
                                }
                                else{
                                    st_two.insert(tree.leader((i + k) * W + j + l));
                                }
                            }
                        }
                    }
                }
            }
            ll len_one = st_one.size();
            ll len_two = st_two.size();
            // debug_out(i, j, len_one, len_two);
            
            ll new_siz = now_kind + (len_one > 0 ? 1 : 0) - max(len_two - 1, 0LL);
            ans_min = min(ans_min, new_siz);
            ans_max = max(ans_max, new_siz);
        }
    }
    cout << ans_min << " " << ans_max << endl;
}