#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
//#define int long long
using namespace __gnu_pbds;
using namespace std;

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

int n,m,d,visr[5010],visc[5010],f[5010][5010],g[5010][5010],h[5010],cnt[5010],a[5010],b[5010],c[5010],L[5010],R[5010];
vector<int> v[5010],vec[5010];

signed main()
{
	ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m>>d;
	for(int i=1;i<=n;i++){
		int x,y;cin>>x>>y;
		visr[x]=1;visc[y]=1;
	}
	for(int i=1;i<=m;i++){
		int x,y;cin>>x>>y;
		v[x].push_back(y);
	}
	for(int i=0;i<=d-1;i++){
		if(i>0){
			for(int j=0;j<=d-1;j++) f[i][j]=f[i-1][j];
		}
		else{
			for(int j=0;j<=d-1;j++) f[i][j]=-1;
		}
		for(int j=0;j<(int)v[i].size();j++){
			f[i][v[i][j]]=i;
		}
	}
	for(int i=d-1;i>=0;i--){
		if(i<d-1){
			for(int j=0;j<=d-1;j++) g[i][j]=g[i+1][j];
		}
		else{
			for(int j=0;j<=d-1;j++) g[i][j]=-1;
		}
		for(int j=0;j<(int)v[i].size();j++){
			if(g[i][v[i][j]]==-1) g[i][v[i][j]]=i;
		}
	}
	int ans=d*d; 
	for(int i=0;i<=d-1;i++){
		for(int j=0;j<=d-1;j++) vec[j].clear();
		for(int j=0;j<=d-1;j++){
			if(visc[j]){
				h[j]=0;
				if(i>0) vec[i-1].push_back(j);
				else vec[d-1].push_back(j);
			}
			else{
				if(i>0&&f[i-1][j]!=-1){
					h[j]=i-f[i-1][j];
					if(f[i-1][j]==0) vec[d-1].push_back(j);
					else vec[f[i-1][j]-1].push_back(j);
				}
				else if(g[i][j]!=-1){
					h[j]=i+d-g[i][j];
					if(g[i][j]>i) vec[g[i][j]-1].push_back(j);
				}
				else h[j]=d+1;
			}
		}
		for(int j=0;j<=d;j++) cnt[j]=0;
		vector<pair<int,int> > o;
		for(int j=0;j<=d-1;j++){
			while(!o.empty()){
				if(o.back().first>h[j]) o.pop_back();
				else break;
			}
			o.push_back(make_pair(h[j],j-d));
		}
		for(int j=0;j<=d-1;j++){
			while(!o.empty()){
				if(o.back().first>h[j]||(o.back().first==h[j]&&o.back().second<0&&o.back().second+d>=j)) o.pop_back();
				else break;
			}
			if(o.empty()) L[j]=-d-1;
			else L[j]=o.back().second;
			o.push_back(make_pair(h[j],j));
		}
		o.clear();
		for(int j=d-1;j>=0;j--){
			while(!o.empty()){
				if(o.back().first>=h[j]) o.pop_back();
				else break; 
			}
			o.push_back(make_pair(h[j],j+d));
		}
		for(int j=d-1;j>=0;j--){
			while(!o.empty()){
				if(o.back().first>h[j]||(o.back().first==h[j]&&(o.back().second<d||o.back().second-d>=j))) o.pop_back();
				else break; 
			}
			if(o.empty()) R[j]=d+d;
			else R[j]=o.back().second;
			o.push_back(make_pair(h[j],j));
		}
		for(int j=0;j<=d-1;j++){
			if(L[j]==-d-1&&R[j]==d+d){
				a[j]=d;b[j]=d-1;c[j]=0;
			}
			else{
				a[j]=R[j]-L[j]-1;b[j]=j-L[j]-1;c[j]=R[j]-j-1;
			}
		}
		bool flag=true;
		cnt[d]++;
		int maxv=d,now=d;
		for(int j=i-1;j>=0;j--){
			for(int k=0;k<(int)vec[j].size();k++){
				int u=vec[j][k];cnt[a[u]]--;cnt[b[u]]++;cnt[c[u]]++;
			}
			while(cnt[maxv]==0) maxv--;
			ans=min(ans,now*(d-maxv));
			if(visr[j]){
				flag=false;break;
			}
			now--;
		}
		if(!flag) continue;
		for(int j=d-1;j>=i;j--){
			for(int k=0;k<(int)vec[j].size();k++){
				int u=vec[j][k];cnt[a[u]]--;cnt[b[u]]++;cnt[c[u]]++;
			}
			while(cnt[maxv]==0) maxv--;
			ans=min(ans,now*(d-maxv)); 
			if(visr[j]){
				flag=false;break;
			}
			now--;
		}
	}
	cout<<ans<<'\n';
	return 0;
}