#include #include using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n) - 1; i >= 0; --i) #define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int h, w, n, d; cin >> h >> w >> n >> d; vector index(h + 1, vector(w + 1, -1)); vector

xy(n); rep(i, n) { cin >> xy[i].first >> xy[i].second; index[xy[i].first][xy[i].second] = i; } dsu uf(n); rep(i, n)rep(j, n) { int dist = abs(xy[i].first - xy[j].first) + abs(xy[i].second - xy[j].second); if (dist <= d)uf.merge(i, j); } int mx = 0; auto gs = uf.groups(); mapmp; for (auto g : gs) { if (g.size() > 1)mx++; mp[uf.leader(g[0])] = g.size(); } int mn = mx; const int fir = mx; rep(i, n) {// N rep2(j, -d, d + 1)rep2(k, -d, d + 1) {//D^2 if (abs(j) + abs(k) > d)continue; P np = xy[i]; np.first += j; np.second += k; if (np.first < 0 || np.first > h)continue; if (np.second < 0 || np.second > w)continue; setst; rep2(l, -d, d + 1)rep2(m, -d, d + 1) {//D^2 int px = np.first + l; int py = np.second + m; if (px < 0 || px > h)continue; if (py < 0 || py > w)continue; int idx = index[px][py]; if (-1 == idx)continue; st.insert(uf.leader(idx)); } int nsz = fir; if (1 == mp[uf.leader(i)])nsz++; int ml = uf.leader(i); for (auto e : st) { if (ml == e)continue; if (1 != mp[e])nsz--; } chmin(mn, nsz); chmax(mx, nsz); } } cout << mn << " " << mx << endl; return 0; }