//-------All power is within you,you can do Anything and Everything.---------//
 
    #include <bits/stdc++.h>
    // #pragma GCC optimize("Ofast")
    using namespace std;
    //library
  
//*$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ M $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$*//
    
    #define F first
    #define S second
    #define pb push_back
    #define mkp make_pair
    #define int long long
    #define ld long double
    //scankar
    #define sz(x) (int)(x).size()
    #define all(x) x.begin(),x.end() 
    #define rall(x) x.rbegin(),x.rend()
    #define fo(i,a,b) for(int i=a;i<b;i++)
    #define rfo(i,b,a) for(int i=b;i>=a;i--)
    #define mem( a, val ) memset(a, val, sizeof( a ) )
    #define deci( x ) cout<<fixed<<setprecision( x );
    #define bitcount( x ) __builtin_popcountll( x )
    #define endl "\n" 
    
    #define XOX 
    
    typedef vector<int> vi;
    typedef pair<int,int> pi; 
    typedef map<int,int> mii;
    typedef map<int,bool> mib;
    typedef map<char,int> mci;
    typedef map<string,int> msi;
    
    const int INF = 1e18L + 5;
    const int MAX = 1500 + 2;
    const int MOD =  998244353;
    const long double PI  =3.141592653589793238463;
    //direction
    
//*$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ D $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$*//
    
    #define deb(x) cout<<#x<<" "<<x<<endl;
    //debugger

//*$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ V $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$*//  
    
    int i,j,k,t,n,q,l,r,mid;

//*$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ F $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$*//
    
    vector<pi> v;
    int nn,mm,x,y,cnt,m;
    int a[MAX][MAX];
    void solve()
    {
        cin>>n>>m;
        cin>>nn>>mm;
        fo(i,0,nn)
        {
            cin>>x>>y;
            a[x][y]=1;
            v.pb({x,y});
        }
        fo(i,0,mm)
        {
            cin>>x>>y;
            a[x][y]=-1;
        }
        fo(i,0,nn)
        {
            x=v[i].F;
            y=v[i].S;
            fo(i,x+1,n+1)
            {
                if(a[i][y]==-1||a[i][y]>=1)break;
                a[i][y]++;
            }
        }
        fo(i,0,nn)
        {
            x=v[i].F;
            y=v[i].S;
            rfo(i,x-1,1)
            {
                if(a[i][y]==-1||a[i][y]>=2)break;
                a[i][y]++;
            }
        }
        fo(i,0,nn)
        {
            x=v[i].F;
            y=v[i].S;
            fo(i,y+1,m+1)
            {
                if(a[x][i]==-1||a[x][i]>=3)break;
                a[x][i]++;
            }
        }
        fo(i,0,nn)
        {
            x=v[i].F;
            y=v[i].S;
            rfo(i,y-1,1)
            {
                if(a[x][i]==-1||a[x][i]>=4)break;
                a[x][i]++;
            }
        }

        fo(i,1,n+1)
        {
            fo(j,1,m+1)
            {
                // cout<<a[i][j]<<" ";
                if(a[i][j]>0)cnt++;
            }
            // cout<<endl;
        }
        cout<<cnt<<endl;
    }
    
//*$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$*//
//                          THE GAME STARTS HERE                             //
 
    int32_t main() 
    {
    
        // int start,stop=clock();
        // cout<<"time:"<<(stop-start)/double(CLOCKS_PER_SEC)*1000<<endl;
        ios_base::sync_with_stdio(0);
        cin.tie(NULL);
        cout.tie(NULL);
        
        // sc(t);while(t--)
        // cin>>t;while(t--)
            solve();
    
        return 0;
    }
#include<bits/stdc++.h>
using namespace std;

int main(){
    int h, w, n, m;
    cin >> h >> w >> n >> m;
    
    int che[h][w];
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            che[i][j] = 0;
        }
    }

    pair<int, int> light[n];
    for(int i = 0; i < n; i++){
        cin >> light[i].first >> light[i].second;
        light[i].first--;
        light[i].second--;
        che[light[i].first][light[i].second] = 2;
    }

    pair<int, int> wall;
    for(int i = 0; i < m; i++){
        cin >> wall.first >> wall.second;
        wall.first--;
        wall.second--;
        che[wall.first][wall.second] = -1;
    }

    for(int i = 0; i < n; i++){
        pair<int, int> s = light[i];
        for(int j = 0; j < 4; j++){
            if(j == 0){
                int t = 1;
                while(1){
                    if(s.first + t >= h){
                        break;
                    }

                    if(che[s.first + t][s.second] == -1 || che[s.first + t][s.second] == 2){
                        break;
                    }else if(che[s.first + t][s.second] == 0){
                        che[s.first + t][s.second] = 1;
                    }
                    t++;
                }
            }else if(j == 1){
                int t = 1;
                while(1){
                    if(s.first - t < 0){
                        break;
                    }

                    if(che[s.first - t][s.second] == -1 || che[s.first - t][s.second] == 2){
                        break;
                    }else if(che[s.first - t][s.second] == 0){
                        che[s.first - t][s.second] = 1;
                    }
                    t++;
                }
            }else if(j == 2){
                int t = 1;
                while(1){
                    if(s.second + t >= w){
                        break;
                    }

                    if(che[s.first][s.second + t] == -1 || che[s.first][s.second + t] == 2){
                        break;
                    }else if(che[s.first][s.second + t] == 0){
                        che[s.first][s.second + t] = 1;
                    }
                    t++;
                }
            }else{
                int t = 1;
                while(1){
                    if(s.second - t < 0){
                        break;
                    }

                    if(che[s.first][s.second - t] == -1 || che[s.first][s.second - t] == 2){
                        break;
                    }else if(che[s.first][s.second - t] == 0){
                        che[s.first][s.second - t] = 1;
                    }
                    t++;
                }
            }
        }
    }

    int ans = 0;
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            if(che[i][j] == 1 || che[i][j] == 2){
                ans++;
            }
        }
    }

    cout << ans << endl;
}