#include <atcoder/dsu>

#include <bits/stdc++.h>

using namespace std;
#define SZ(x) (int) (x).size()
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(auto i = (a); i < (b); i++)
#define For(i, a, b, c) \
	for(auto i = (a); i != (b); i += (c))
#define REPR(i, n) for(auto i = (n) -1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), (v).end())
#define eb emplace_back

typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
const double EPS = 1e-6;
const int MOD = 1e9 + 7;
const int INF = (1 << 30);
const ll LINF = 1e18;
const double math_PI = acos(-1);

template<typename T>
vector<T> make_v(size_t a) {
	return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(
		a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(
	T& t, const V& v) {
	t = v;
}

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(
	T& t, const V& v) {
	for(auto& e: t) fill_v(e, v);
}

template<class T>
bool chmax(T& a, const T& b) {
	if(a < b) {
		a = b;
		return true;
	}
	return false;
}

template<class T>
bool chmin(T& a, const T& b) {
	if(a > b) {
		a = b;
		return true;
	}
	return false;
}

template<typename S, typename T>
istream& operator>>(istream& is, pair<S, T>& p) {
	cin >> p.first >> p.second;
	return is;
}

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	for(T& x: vec) is >> x;
	return is;
}

template<typename T>
string join(vector<T>& vec, string splitter) {
	stringstream ss;
	REP(i, SZ(vec)) {
		if(i != 0) ss << splitter;
		ss << vec[i];
	}
	return ss.str();
}

template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	os << join(vec, " ");
	return os;
}

#ifdef LOCAL
#include "./cpp-dump/dump.hpp"
#include "./cpp-dump/mytypes.hpp"
#define dump(...) cpp_dump(__VA_ARGS__)
namespace cp = cpp_dump;
#else
#define dump(...)
#define preprocess(...)
#define CPP_DUMP_SET_OPTION(...)
#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)
#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)
#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)
#endif
using namespace atcoder;

void solve() {
	int H, W, N, D;
	cin >> H >> W >> N >> D;
	vector<vi> star(H, vi(W, -1));
	vector<PI> S;
	REP(i, N) {
		int X, Y;
		cin >> X >> Y;
		X--;
		Y--;
		S.emplace_back(X, Y);
		star[X][Y] = i;
	}
	auto check = [&](int y, int x) -> bool {
		if(y < 0 || y >= H) return false;
		if(x < 0 || x >= W) return false;
		return true;
	};
	dsu d(N);
	REP(i, N) {
		auto [x, y] = S[i];
		for(int dx = -D; dx <= D; dx++) {
			for(int dy = -D; dy <= D; dy++) {
				if(abs(dx) + abs(dy) > D) continue;
				if(!check(x + dx, y + dy)) continue;
				if(star[x + dx][y + dy] >= 0) {
					d.merge(i, star[x + dx][y + dy]);
				}
			}
		}
	}
	int mn = N;
	int mx = 0;
	REP(x, H) {
		REP(y, W) {
			set<int> l;
			bool f = false;
			for(int dx = -D; dx <= D; dx++) {
				for(int dy = -D; dy <= D; dy++) {
					if(abs(dx) + abs(dy) > D) continue;
					if(!check(x + dx, y + dy)) continue;
					if(star[x + dx][y + dy] >= 0) {
						if(d.size(star[x + dx][y + dy]) > 1)
							l.insert(d.leader(
								star[x + dx][y + dy]));
						else
							f = true;
					}
				}
			}
			if(l.empty() && f) {
				mn = -1;
			}
			if(!l.empty()) {
				chmax(mx, SZ(l) - 1);
				chmin(mn, SZ(l) - 1);
			}
			dump(x, y, l);
		}
	}

	int g = 0;
	for(auto gg: d.groups()) {
		if(SZ(gg) > 1) g++;
	}
	cout << g - mx << " " << g - mn << endl;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	preprocess();
	solve();
	return 0;
}