/*************************************
* author: marvinthang *
* created: 08.08.2023 09:55:08 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b) { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b) { if (a < b) { a = b; return true; } return false; }
// end of template
const int MAX = 5005;
int N, M, D;
vector <int> hasA_X, hasA_Y;
vector <vector <int>> hasB;
void init(void) {
cin >> N >> M >> D;
hasA_X.resize(D + D);
hasA_Y.resize(D);
while (N--) {
int x, y; cin >> x >> y;
hasA_X[x] = hasA_X[x + D] = true;
hasA_Y[y] = true;
}
hasB.assign(D + D, vector<int>(D));
while (M--) {
int x, y; cin >> x >> y;
if (hasA_X[x] || hasA_Y[y]) continue;
hasB[x][y] = hasB[x + D][y] = true;
}
}
vector <int> left, right;
bitset <MAX> bs;
int max_len;
void insert(int x) {
int prv = x ? x - 1 : D - 1;
int nxt = x + 1 < D ? x + 1 : 0;
int l = bs[prv] ? left[prv] : x;
int r = bs[nxt] ? right[nxt] : x;
maximize(max_len, r - l + 1 + (r < l ? D : 0));
bs[x] = 1;
right[l] = r;
left[r] = l;
}
void process(void) {
left.resize(D);
right.resize(D);
vector <int> last(D);
vector <vector <int>> add(D + D);
int res = D * D;
REP(i, D) if (!hasA_X[i]) {
int j = i;
while (!hasA_X[j + 1]) ++j;
last.assign(D, -1);
FORDE(l, j, i) {
REP(i, D) if (hasB[l][i]) last[i] = l;
if (l >= D) continue;
REP(i, D) if (~last[i]) add[last[i]].push_back(i);
REP(i, D) left[i] = right[i] = bs[i] = 0;
max_len = 0;
REP(i, D) if (!hasA_Y[i] && !~last[i]) insert(i);
FORDE(r, j, l) {
minimize(res, (D - r + l - 1) * (D - max_len));
for (int x: add[r]) insert(x);
add[r].clear();
}
minimize(res, D * (D - max_len));
}
i = j;
}
cout << res << '\n';
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("garden");
init();
process();
cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
