// Hydro submission #64dc9c78a14958b93e7a25fe@1692179576497
#include <iostream>
#include <cstdio>
#include <cstring>
#define REP(i, s, n) for(int i = s; i <= n; i ++)
#define REP_(i, s, n) for(int i = n; i >= s; i --)
#define MAX_N 10000 + 10
#define mod 1000000000 + 7

using namespace std;

int n, m, k, q;
int map[MAX_N][MAX_N];

int main(){
    scanf("%d%d%d", &n, &m, &k);
    int x, y; memset(map, 0, sizeof(map));
    REP(i, 1, k){
        scanf("%d%d", &x, &y);
        map[y][x] = 1;
    }    
    REP(i, 1, m) map[i][0] = map[i][n + 1] = 1;
    if(m == 1){
        scanf("%d", &q);
        while(q --){
            int x, y; scanf("%d%d", &x, &y);
            printf("0\n");
        }
    }
    else if(m == 2){
        scanf("%d", &q);
        while(q --){
            int x, y; scanf("%d%d", &y, &x);
            int tmp = y, l, r;
            while((!map[1][tmp]) && (!map[2][tmp])) tmp --;
            l = y - tmp; tmp = y + 1;
            while((!map[1][tmp]) && (!map[2][tmp])) tmp ++;
            r = tmp - (y + 1);
            cout << l * r << endl;
        }
    }    
    return 0;
}