#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

// type
typedef long long ll;
typedef long double ld;
using i128 = __int128_t;
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> using v = vector<T>;
#define V vector
#define pl pair<ll, ll>
#define vl v<ll>
#define vp v<pl>
#define vm v<mint>
 
// IN-OUT
#define NYAN ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15);
ostream &operator<<(ostream &os, const i128 &v) {
    if(v == 0) { return (os << "0"); }
    i128 num = v;
    if(v < 0) { os << '-'; num = -num; }
    string s;
    for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }
    reverse(s.begin(), s.end());
    return (os << s);
}
void Yes(bool b=1) { cout << ( b == 1 ? "Yes" : "No" ) << "\n"; }
void YES(bool b=1) { cout << ( b == 1 ? "YES" : "NO" ) << "\n"; }
void No(bool b=1) { cout << ( b == 1 ? "No" : "Yes" ) << "\n"; }
void NO(bool b=1) { cout << ( b == 1 ? "NO" : "YES" ) << "\n"; }
void CIN() {}
template <typename T, class... U> void CIN(T &t, U &...u) { cin >> t; CIN(u...); }
void COUT() { cout << "\n"; }
template <typename T, class... U, char sep = ' '> void COUT(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; COUT(u...); }
#define dump(x) cerr << #x << ":"<< x << "\n";
#define vdump(x) rep(repeat, sz(x)) cerr << repeat << ":" << x[repeat] << "\n";
 
// macro
#define bp __builtin_popcountll
#define ALL(x) x.begin(),x.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define reps(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define sz(x) (ll)x.size()
ll xd[]={0, 1, 0, -1, 1, 1, -1, -1};
ll yd[]={1, 0, -1, 0, 1, -1, -1, 1};

// function
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>int bl(T x) { int s = 0; while(x) {x >>= 1; s++;} return s; } // bitlength
ll rmax(ll a, ll b){return max(a, b);}
ll rmin(ll a, ll b){return min(a, b);}
ll rsum(ll a, ll b){return a + b;}
ll rzero(){return 0;}

// constant
long double PI = 3.14159265358979;
#define INF32 2147483647
#define INF64 9223372036854775807
#define INF 922337203685477580
using mint = modint998244353;
// using mint = modint1000000007;


/* SOLVE BEGIN ************************************************************************** */

void solve()
{
  ll h, w, n, d;
  CIN(h, w, n, d);
  vl x(n), y(n);
  rep(i, n){
    cin >> x[i] >> y[i];
    x[i]--; y[i]--;
  }
  
  auto ng = [&](ll X, ll Y){
    return X < 0 || Y < 0 || X >= h || Y >= w;
  };
  
  dsu t(n);
  
  v<vl> g(h, vl(w, -1));
  rep(i, n) g[x[i]][y[i]] = i;
  
  rep(i, h)rep(j, w){
    if(g[i][j] == -1) continue;
    ll now = g[i][j];
    
    reps(X, i - d, i + d + 1)reps(Y, j - d, j + d + 1){
      if(ng(X, Y) || abs(i - X) + abs(j - Y) > d) continue;
      if(g[X][Y] != -1) t.merge(g[X][Y], now);
    }
  }
  
  v<v<set<ll>>> one(h, v<set<ll>>(w));
  v<v<set<ll>>> two(h, v<set<ll>>(w));
  
  rep(i, h)rep(j, w){
    if(g[i][j] == -1) continue;
    ll now = g[i][j];
    
    reps(X, i - d, i + d + 1)reps(Y, j - d, j + d + 1){
      if(ng(X, Y) || abs(i - X) + abs(j - Y) > d) continue;
      if(t.size(now) == 1) one[X][Y].emplace(now);
      else two[X][Y].emplace(t.leader(now));
    }
  }
  
  ll base = 0;
  rep(i, n) if(t.leader(i) == i && t.size(i) > 1) base++;
  
  ll Min = INF, Max = 0;
  rep(i, h)rep(j, w){
    if(g[i][j] != -1) continue;
    ll now = base;
    
    if(sz(two[i][j])) now -= sz(two[i][j]) - 1;
    else now += (sz(one[i][j]) > 0);
    
    chmax(Max, now);
    chmin(Min, now);
  }
  COUT(Min, Max);

}

int main()
{
  NYAN
  solve();
  return 0;
}