#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 998244353
#define INF 1000000000000000000

struct consec {
    bool ison[5000];
    int l[5000], r[5000], n, mx;
    consec(int _n) {
        n = _n;
    }
    void on(int x) {
        ison[x] = true;
        int prv = x ? x-1 : n-1;
        int nxt = x<n-1 ? x+1 : 0;
        int nl = ison[prv] ? l[prv] : x;
        int nr = ison[nxt] ? r[nxt] : x;
        if(nl == nxt) {
            mx = n;
            return;
        }
        mx = max(mx, (nr-nl+n)%n+1);
        r[nl] = nr;
        l[nr] = nl;
    }
    int get() {
        return mx;
    }
} *s;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m, d, x, y, ans = INF;
    cin >> n >> m >> d;
    vector<int> bx[2*d];
    bool cx[2*d], cy[d];
    memset(cy, 0, sizeof(cy));
    memset(cx, 0, sizeof(cx));
    int last[d];
    vector<int> pos[2*d];
    for(int i = 0; i < n; i++) {
        cin >> x >> y;
        cx[x] = true;
        cy[y] = true;
    }
    for(int i = 0; i < m; i++) {
        cin >> x >> y;
        if(cx[x] || cy[y]) continue;
        bx[x].push_back(y);
    }
    for(int i = 0; i < d; i++) {
        cx[i+d] = cx[i];
        bx[i+d] = bx[i];
    }
    for(int id = 1; id <= d; id++) {
        if(!cx[id-1]) continue;
        int r = id;
        while(!cx[r]) r++;
        memset(last, -1, sizeof(last));
        for(int l = r; l >= id; l--) {
            for(int i : bx[l]) last[i] = l;
            for(int i = l; i <= r; i++) pos[i].clear();
            for(int i = 0; i < d; i++) if(last[i] != -1) {
                pos[last[i]].push_back(i);
            }
            s = new consec(d);
            for(int i = 0; i < d; i++) if(!cy[i] && last[i] == -1) s->on(i);
            for(int R = r; R >= l; R--) {
                for(int i : pos[R]) s->on(i);
                ans = min(ans, (d-(R-l))*(d-s->get()));
            }
        }
        id = r;
    }
    cout << ans;
}