#include using namespace std; #include using namespace atcoder; using ll = long long; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; using VD = vector; using VVD = vector; using VS = vector; using P = pair; using VP = vector

; #define rep(i, n) for (ll i = 0; i < ll(n); i++) #define out(x) cout << x << endl #define dout(x) cout << fixed << setprecision(10) << x << endl #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() #define sz(x) (int)(x.size()) #define re0 return 0 #define pcnt __builtin_popcountll template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } constexpr int inf = 1e9; constexpr ll INF = 1e18; //using mint = modint1000000007; using mint = modint998244353; int main(){ ll h,w,n,d; cin >> h >> w >> n >> d; VL x(n),y(n); VVL board(h,VL(w,-1)); rep(i,n){ cin >> x[i] >> y[i]; x[i]--,y[i]--; board[x[i]][y[i]] = i; } VL di,dj; for(ll i = -d;i <= d;i++){ for(ll j = -d;j <= d;j++){ if(abs(i)+abs(j) <= d){ di.emplace_back(i); dj.emplace_back(j); } } } dsu uf(h*w); rep(i,h)rep(j,w) if(board[i][j] != -1){ rep(v,sz(di)){ ll ni = i+di[v]; ll nj = j+dj[v]; if(ni < 0 || nj < 0 || ni >= h || nj >= w) continue; if(board[ni][nj] != -1){ uf.merge(i*w+j,ni*w+nj); } } } ll now = 0; rep(i,h)rep(j,w)if(board[i][j]!=-1&&uf.leader(i*w+j)==i*w+j&&uf.size(i*w+j)>=2)now++; ll ansmx = 0,ansmn = INF; rep(i,h)rep(j,w) if(board[i][j] == -1){ unordered_set seen; ll flag = 0; rep(v,sz(di)){ ll ni = i+di[v]; ll nj = j+dj[v]; if(ni < 0 || nj < 0 || ni >= h || nj >= w) continue; if(board[ni][nj] != -1 && !seen.count(uf.leader(ni*w+nj))){ if(uf.size(ni*w+nj)>=2) seen.insert(uf.leader(ni*w+nj)); flag = 1; } } chmin(ansmn,now-sz(seen)+flag); chmax(ansmx,now-sz(seen)+flag); } cout << ansmn << ' ' << ansmx << endl; }