#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long
using i64 = long long;
template <class F, class _S>
bool chmin(F &u, const _S &v){
bool flag = false;
if ( u > v ){
u = v; flag |= true;
}
return flag;
}
template <class F, class _S>
bool chmax(F &u, const _S &v){
bool flag = false;
if ( u < v ){
u = v; flag |= true;
}
return flag;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, d; cin >> n >> m >> d;
vector <int> P(n), Q(n), R(m), S(m);
for ( int i = 0; i < n; i++ ){
cin >> P[i] >> Q[i];
}
for ( int i = 0; i < m; i++ ){
cin >> R[i] >> S[i];
}
{ // sorting
vector <int> p_(m);
iota(all(p_), 0);
sort(all(p_), [&](int &u, int &v){
return R[u] < R[v];
});
auto _R = R, _S = S;
for ( int i = 0; i < m; i++ ){
R[i] = _R[p_[i]];
S[i] = _S[p_[i]];
}
p_ = vector <int> (n);
iota(all(p_), 0);
sort(all(p_), [&](int &u, int &v){
return P[u] < P[v];
});
auto _P = P, _Q = Q;
for ( int i = 0; i < n; i++ ){
P[i] = _P[p_[i]];
Q[i] = _Q[p_[i]];
}
}
vector <int> v(d * 2, -1), has(d * 2), tv(d * 2, -1);
vector <vector<int>> er(d * 2);
for ( int i = 0; i < n; i++ ){
chmax(tv[Q[i]], P[i]);
has[Q[i]] = true;
}
for ( int i = 0; i < m; i++ ){
chmax(v[S[i]], R[i]);
has[S[i]] = true;
}
for ( int i = 0; i < d * 2; i++ ){
if ( v[i] != -1 ){
er[v[i]].pb(i);
}
}
int opt = 1e9, mx = *max_element(all(P)), _ip = 0, _ir = 0;
for ( int l = 0; l < d; l++ ){
while ( _ip < n && P[_ip] < l ){
chmax(mx, P[_ip] + d);
chmax(tv[Q[_ip]], P[_ip] + d);
_ip++;
}
while ( _ir < m && R[_ir] < l ){
auto flag = chmax(v[S[_ir]], R[_ir] + d);
if ( flag > 0 ){
er[R[_ir] + d].pb(S[_ir]);
}
_ir++;
}
set <int> st;
vector <int> lf(d * 2, -1), rg(d * 2, -1);
for ( int i = 1; i < d * 2; i++ ){
if ( has[i - 1] > 0 ){
lf[i] = i - 1;
} else{
lf[i] = lf[i - 1];
}
}
for ( int i = (d - 1) * 2; i >= 0; i-- ){
if ( has[i + 1] ){
rg[i] = i + 1;
} else{
rg[i] = rg[i + 1];
}
}
int maxDiff = 0;
for ( int i = 0; i < d * 2; i++ ){
if ( has[i] > 0 ){
st.insert(i);
if ( rg[i] != -1 ){
chmax(maxDiff, rg[i] - i);
}
}
}
auto del = [&](int x){
st.erase(x);
if ( lf[x] != -1 ){
rg[lf[x]] = rg[x];
}
if ( rg[x] != -1 ){
lf[rg[x]] = lf[x];
}
if ( lf[x] != -1 && rg[x] != -1 ){
chmax(maxDiff, rg[x] - lf[x]);
}
};
for ( int r = l; r <= l + d; r++ ){
for ( auto &y: er[r] ){
if ( v[y] > tv[y] ){
del(y);
}
}
if ( r >= mx ){
chmin(opt, (r - l + 1) * min(*st.rbegin() - *st.begin() + 1, d - maxDiff + 1));
}
}
}
cout << opt;
cout << '\n';
}
