#include <bits/stdc++.h>
using namespace std;
const int MAX_D = 5000;
struct info {
bool all0;
int pref0, suf0, max0;
info operator + ( const info &x ) const {
info ans;
ans.all0 = all0 & x.all0;
ans.pref0 = pref0 + all0 * x.pref0;
ans.suf0 = x.suf0 + x.all0 * suf0;
ans.max0 = max( max( max0, x.max0 ), suf0 + x.pref0 );
return ans;
}
};
struct SegTree {
info segTree[4 * MAX_D];
void update( int v, int l, int r, int p, int x ) {
if ( l > p || r < p )
return;
if ( l == r ) {
segTree[v] = { (x == 0), (x == 0), (x == 0), (x == 0) };
return;
}
int mid = (l + r) / 2;
update( v * 2 + 1, l, mid, p, x );
update( v * 2 + 2, mid + 1, r, p, x );
segTree[v] = segTree[v * 2 + 1] + segTree[v * 2 + 2];
}
};
SegTree fr;
int frecvX[MAX_D], frecvY[MAX_D], posY[MAX_D];
vector<int> vy[MAX_D], upd[MAX_D];
int main() {
ios_base::sync_with_stdio( false );
cin.tie( NULL );
int n, m, d;
cin >> n >> m >> d;
for ( int i = 0; i < n; i++ ) {
int x, y;
cin >> x >> y;
frecvX[x]++;
frecvY[y]++;
}
for ( int i = 0; i < m; i++ ) {
int x, y;
cin >> x >> y;
vy[y].push_back( x );
frecvY[y]++;
}
for ( int y = 0; y < d; y++ )
sort( vy[y].begin(), vy[y].end() );
int minArea = d * d;
for ( int l = 0; l < d; l++ ) {
for ( int x = 0; x < d; x++ )
upd[x].clear();
for ( int y = 0; y < d; y++ )
posY[y] = 0;
for ( int y = 0; y < d; y++ ) {
fr.update( 0, 0, d - 1, y, (frecvY[y] > 0) );
if ( vy[y].empty() )
continue;
while ( posY[y] < vy[y].size() && vy[y][posY[y]] < l )
posY[y]++;
posY[y] = (posY[y] - 1 + vy[y].size()) % vy[y].size();
upd[vy[y][posY[y]]].push_back( y );
}
int countX = 0;
for ( int r = l; r < d; r++ ) {
countX += frecvX[r];
for ( int y: upd[r] )
fr.update( 0, 0, d - 1, y, 0 );
int max0 = fr.segTree[0].max0;
int pref0 = fr.segTree[0].pref0;
int suf0 = fr.segTree[0].suf0;
max0 = max( max0, min( d, suf0 + pref0 ) );
if ( countX >= n )
minArea = min( minArea, (r - l + 1) * (d - max0) );
}
for ( int r = 0; r < l; r++ ) {
countX += frecvX[r];
for ( int y: upd[r] )
fr.update( 0, 0, d - 1, y, 0 );
int max0 = fr.segTree[0].max0;
int pref0 = fr.segTree[0].pref0;
int suf0 = fr.segTree[0].suf0;
max0 = max( max0, min( d, suf0 + pref0 ) );
if ( countX >= n )
minArea = min( minArea, (d - l + r + 1) * (d - max0) );
}
}
cout << minArea;
return 0;
}
