#include <atcoder/dsu>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll h, w, n, d;
  cin >> h >> w >> n >> d;
  vector grid(h, vector<ll>(w, -1));
  rep(ni, n) {
    ll x, y;
    cin >> x >> y, x--, y--;
    grid[x][y] = ni;
  }
  atcoder::dsu dsu(n);
  rep(x, h) rep(y, w) {
    ll ni = grid[x][y];
    if (ni == -1)
      continue;
    for (ll xi = x - d; xi <= x + d; xi++) {
      if (xi < 0 || h <= xi)
        continue;
      ll dx = abs(x - xi);
      for (ll yi = y - d + dx; yi <= y + d - dx; yi++) {
        if (yi < 0 || w <= yi)
          continue;
        ll nj = grid[xi][yi];
        if (nj == -1 || ni == nj)
          continue;
        dsu.merge(ni, nj);
      }
    }
  }
  ll orig = 0;
  for (const auto &g : dsu.groups()) {
    if (g.size() >= 2)
      orig++;
  }
  ll ans_min = orig, ans_max = orig;
  rep(x, h) rep(y, w) {
    if (grid[x][y] != -1)
      continue;
    set<ll> st;
    vector<ll> cnt(3);
    for (ll xi = x - d; xi <= x + d; xi++) {
      if (xi < 0 || h <= xi)
        continue;
      ll dx = abs(x - xi);
      for (ll yi = y - d + dx; yi <= y + d - dx; yi++) {
        if (yi < 0 || w <= yi)
          continue;
        ll nj = grid[xi][yi];
        if (nj == -1)
          continue;
        nj = dsu.leader(nj);
        if (st.count(nj) == 1)
          continue;
        st.insert(nj);
        cnt[min(dsu.size(nj), 2)] += 1;
      }
    }
    if (st.empty())
      continue;
    ll now = orig;
    if (cnt[1]) {
      now += 1;
      now -= cnt[2];
    } else {
      now -= cnt[2] - 1;
    }
    ans_min = min(ans_min, now);
    ans_max = max(ans_max, now);
  }
  cout << ans_min << ' ' << ans_max << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}