#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+5;
const int INF=1e9+9;
struct Node{
	int l,r;
}c[2][N];
double d[N][2][2];
bool cmp(Node x,Node y){
	return x.l<y.l;
}
int n1,n2,T;
int bel(double tim,bool op){
	int l=1,r=(!op)?n1:n2,ans=0;
	while(l<=r){
		int mid=l+r>>1;
		if(c[op][mid].r>=tim){
			ans=mid;
			r=mid-1;
		}
		else l=mid+1;
	}
	return ans;
}
signed main(){
	scanf("%lld%lld%lld",&n1,&n2,&T);
	for(int i=1;i<=n1;i++){
		scanf("%lld%lld",&c[0][i].l,&c[0][i].r);
	}
	for(int i=1;i<=n2;i++){
		scanf("%lld%lld",&c[1][i].l,&c[1][i].r);
	}
	c[0][n1+1].l=c[0][n1+1].r=INF;
	c[1][n2+1].l=c[1][n2+1].r=INF;
	sort(c[0]+1,c[0]+n1+1,cmp);
	sort(c[1]+1,c[1]+n2+1,cmp);
	for(int i=0;i<=n1+n2;i++){
		d[i][0][0]=d[i][0][1]=d[i][1][0]=d[i][1][1]=INF;
	}
	d[0][0][0]=0.5;
	int max_x=0;
	for(int i=0;i<=n1+n2;i++){
		for(int j=0;j<=1;j++){
			for(int k=0;k<=1;k++){
				if(d[i][j][k]>=INF/2)continue;
				max_x=max(max_x,i);
				//cout<<i<<" "<<j<<" "<<k<<":"<<d[i][j][k]<<"\n";
				int tnow=bel(d[i][j][k],j);
				int ano=bel(d[i][j][k],j^1);
				bool flag=(c[j^1][ano].l<=d[i][j][k]&&d[i][j][k]<=c[j^1][ano].r&&k);
				bool flgg=(c[j][tnow].l<=d[i][j][k]&&d[i][j][k]<=c[j][tnow].r);
				int tt=bel(d[i][j][k]+T,j^1);
				//cout<<tt<<"\n";
				if(!tt)continue;
				if(flag&&(tt==ano)){
					bool flg=(bel(max(d[i][j][k]+T,c[j^1][tt+1].l+0.5),j)==tnow&&flgg);
					//if(i==3&&j==0&&flg)cout<<i<<" "<<j<<" "<<k<<"\n";
					d[i+1][j^1][flg]=min(d[i+1][j^1][flg],max(d[i][j][k]+T,c[j^1][tt+1].l+0.5));
				}
				else{
					bool flg=(bel(max(d[i][j][k]+T,c[j^1][tt].l+0.5),j)==tnow&&flgg);
					//if(i==3&&j==0&&flg)cout<<i<<" "<<j<<" "<<k<<"\n";
					d[i+1][j^1][flg]=min(d[i+1][j^1][flg],max(d[i][j][k]+T,c[j^1][tt].l+0.5));
				}
				if(tnow){
					//???
					if(flgg){
						double nxttim=c[j][tnow+1].l+0.5;
						bool fll=(bel(nxttim,j^1)==ano&&flag);
						d[i+1][j][fll]=min(d[i+1][j][fll],nxttim);
					}
					else{
						double nxttim=c[j][tnow].l+0.5;
						bool fll=(bel(nxttim,j^1)==ano&&flag);
						d[i+1][j][fll]=min(d[i+1][j][fll],nxttim);	
					}
				}
			}
		}
	}
	cout<<max_x<<"\n";
	return 0;
}