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

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> ax, bx[d];
    int cy[d], by[m];
    memset(cy, 0, sizeof(cy));
    for(int i = 0; i < n; i++) {
        cin >> x >> y;
        ax.push_back(x);
        cy[y]++;
    }
    for(int i = 0; i < m; i++) {
        cin >> x >> by[i];
        bx[x].push_back(i);
    }
    sort(ax.begin(), ax.end());
    ax.erase(unique(ax.begin(), ax.end()), ax.end());
    int prv = ax.back();
    for(int i : ax) {
        int cnt = 0;
        for(int j = (prv+1)%d; j != i; j=(j+1)%d) {
            for(int k : bx[j]) cy[by[k]]++;
            cnt++;
        }
        int idx = 0, cur = 0, mx = 0;
        while(cy[idx] == 0) idx++;
        for(int j = (idx+1)%d; j != idx; j=(j+1)%d) {
            if(cy[j]) cur = 0;
            else cur++;
            mx = max(mx, cur);
        }
        ans = min(ans, (d-cnt)*(d-mx));
        for(int j = (prv+1)%d; j != i; j=(j+1)%d) {
            for(int k : bx[j]) cy[by[k]]--;
        }
        prv = i;
    }
    cout << ans;
}