#include "bits/stdc++.h"

#include <stdio.h>
#include <math.h>

#include "atcoder/all"
#include <float.h>

#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>;
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

struct xy { ll x; ll y; };

struct info {
	set<ll> gp;
	ll sol_i = -1;
};

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);


	ll h, w, n, d;
	cin >> h >> w >> n >> d;

	vector<xy> v(n);
	REP(i, n) cin >> v[i].x >> v[i].y;
	REP(i, n) {
		v[i].x--; v[i].y--;
	}

	//星のグループにIDを振る
	vvl sid(h, vl(w, -llhuge));
	REP(i, n) sid[v[i].x][v[i].y] = -1;

	set<ll> group;

	ll id = 0;
	REP(i, n) {
		if (sid[v[i].x][v[i].y] != -1) continue;
		ll gpcnt = 0;

		queue<xy> q;
		q.push(v[i]);
		while (!q.empty()) {
			xy p = q.front();
			q.pop();
			if (sid[p.x][p.y] != -1) continue;
			sid[p.x][p.y] = id;
			gpcnt++;

			REPI(ix, -d, d + 1) REPI(iy, -d, d + 1) {
				if (abs(ix) + abs(iy) > d) continue;
				if (p.x + ix < 0 || p.x + ix >= h) continue;
				if (p.y + iy < 0 || p.y + iy >= w) continue;
				if (sid[p.x + ix][p.y + iy] == -1) q.push({ p.x + ix, p.y + iy });
			}
		}

		if (gpcnt >= 2) group.insert(id);
		id++;
	}

	vector<vector<info>> ginfo(h, vector<info>(w));
	REP(i, n) {
		xy p = v[i];
		ll gp = sid[p.x][p.y];
		bool isgp = group.find(gp) != group.end();

		REPI(ix, -d, d + 1) REPI(iy, -d, d + 1) {
			if (abs(ix) + abs(iy) > d) continue;
			if (p.x + ix < 0 || p.x + ix >= h) continue;
			if (p.y + iy < 0 || p.y + iy >= w) continue;
			
			if (isgp) {
				ginfo[p.x+ix][p.y+iy].gp.insert(gp);
			}
			else {
				ginfo[p.x + ix][p.y + iy].sol_i = gp;
			}
		}
	}

	ll mn = llhuge;
	ll mx = -llhuge;

	REP(i, h) REP(j, w) {
		if (!ginfo[i][j].gp.empty()) {
			chmin(mn, 1 - (ll(ginfo[i][j].gp.size())));
			chmax(mx, 1 - (ll(ginfo[i][j].gp.size())));
		}
		else if (ginfo[i][j].sol_i != -1) {
			chmin(mn, 1);
			chmax(mx, 1);
		}
		else {
			chmin(mn, 0);
			chmax(mx, 0);
		}
	}

	cout << group.size() + mn << " " << group.size() + mx << endl;
}