#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n;
bool b[N][N];
int h, hx[N], hy[N];
int y, yx[N], yy[N];
void chb(int cx, int cy){
    int i;
    for(i=cx-2;i<=cx+2;i++)
        b[i][cy] = true;
    for(i=cy-2;i<=cy+2;i++)
        b[cx][i] = true;
    b[cx - 1][cy - 1] = true;
    b[cx - 1][cy + 1] = true;
    b[cx + 1][cy - 1] = true;
    b[cx + 1][cy + 1] = true;
}
void fys(int fx, int fy){
    int i, j;
    for(i=fx-2;i<=fx+2;i++){
        for(j=fy-2;j<=fy+2;j++){
            b[i][j] = true;
        }
    }
}
int main(){
    int i, j, sum = 0;
    memset(b, false, sizeof(b));
    cin >> n >> h >> y;
    for(i=1;i<=h;i++){
        int h_x, h_y;
        cin >> hx[i] >> hy[i];
        h_x = hx[i];
        h_y = hy[i];
        chb(h_x, h_y);
    }
    for(i=1;i<=h;i++){
        int y_x, y_y;
        cin >> yx[i] >> yy[i];
        y_x = yx[i];
        y_y = yy[i];
        fys(y_x, y_y);
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++){
            if(b[i][j] = false)
              sum += 1;
        }
    }
    cout << sum << endl;
    return 0;
}

救救蒟蒻 qwq