#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************

// 5
// 2 2
// 5
// 1 1
// 2 3
// 3 4
// 2 4
// 5 5



vector<vector<int>> a;

int consistency(int n, int x, int y){

	vector<vector<int>> grid(n, vector<int>(n, 0));
	for(auto& p : a){
		int x = p[0]-1;
		int y = p[1]-1;
		
		grid[x][y] = 1;
	}
	
	vector<vector<int>> prefix(n+1, vector<int>(n+1, 0));
	for(int i=1; i<=n; i++){
		for(int j=1; j<=n; j++){
			prefix[i][j] = prefix[i][j-1] + prefix[i-1][j] - prefix[i-1][j-1] + grid[i-1][j-1];
		}
	}
	
	int ans = 0;
	
	for(int i=x-1; i<=n-1; i++){
		for(int j=y-1; j<=n-1; j++){
			
			int pts = prefix[i+1][j+1] - prefix[i-x+1][j+1] - prefix[i+1][j-y+1] + prefix[i-x+1][j-y+1];
			
			ans = max(ans, pts);
			
		}
	}
	
	return ans;

}















int practice(int n, int x, int y){


    return 0;
}





void solve() {
    
    int n;
    cin >> n;
    int x , y;
    cin >> x >> y;
    
    int m;
    cin>> m;
    
    a.resize(m);
    for(int i=0; i<m; i++){
    	int p , q;
    	cin >> p >> q;
    	a[i] = {p, q};
    }
    
    cout << consistency(n, x, y) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}