#include<bits/stdc++.h>
using namespace std;
const int N=6e5+5,inf=1e9+7;
int n0,n1,K,f[N][2][2],ans;
vector<pair<int,int> >p[2];
inline void U(int &x,int y){
	x=x>y?y:x;
}
int main(){
	scanf("%d%d%d",&n0,&n1,&K);
	for(int i=1,x,y;i<=n0;++i){
		scanf("%d%d",&x,&y);
		p[0].emplace_back(x,y);
	}
	for(int i=1,x,y;i<=n1;++i){
		scanf("%d%d",&x,&y);
		p[1].emplace_back(x,y);
	}
	sort(p[0].begin(),p[0].end());
	sort(p[1].begin(),p[1].end());
	memset(f,0x3f,sizeof(f));
	f[0][0][0]=-1;
	for(int i=0;i<=n0+n1;++i)for(int j=0;j<2;++j)for(int k=0;k<2;++k)if(f[i][j][k]<inf){
		ans=i;
		int t=f[i][j][k],w;
		int u=upper_bound(p[j].begin(),p[j].end(),make_pair(t,inf))-p[j].begin()-1,v=upper_bound(p[j^1].begin(),p[j^1].end(),make_pair(t,inf))-p[j^1].begin()-1;
		if(u+1<p[j].size()){
			w=p[j][u+1].first;
			if(v>=0&&p[j^1][v].second>w)U(f[i+1][j][k],w);
			else U(f[i+1][j][0],w);
		}
		if(t+K<inf){
			int o=upper_bound(p[j^1].begin(),p[j^1].end(),make_pair(t+K,inf))-p[j^1].begin()-1;
			if(o<0||k&&o==v||p[j^1][o].second<=t+K)++o;
			if(o<p[j^1].size()&&p[j^1][o].second>t+K){
				w=max(p[j^1][o].first,t+K);
				int z=upper_bound(p[j].begin(),p[j].end(),make_pair(w,inf))-p[j].begin()-1;
				U(f[i+1][j^1][z==u],w);
			}
		}
	}
	printf("%d\n",ans);
	return 0;
}