全WA求调！！！

#include<iostream>
#include<algorithm>
using namespace std;
	typedef long long ll;
	struct str{
		ll w,v;
	}a[200005];
	bool cmp(str x,str y){
		return x.w<y.w;
	}
	ll n,m,s,l[200005],r[200005],pre[200005],ans=1e18;
	ll Find(ll x,ll L,ll R){
		ll l=L,r=R,Ans=-1;
		while(l<=r){
			ll mid=(l+r)>>1;
			if(a[mid].w<x){
				l=mid+1;
			}else{
				Ans=mid;
				r=mid-1;
			}
		}
		if(Ans==-1) return -1;
		return Ans+L-1;
	}                             //自己写的upper_bound
	ll check(ll W){
		ll sum=0;
		for(int i=1;i<=m;i++){
			ll idx=Find(W,l[i],r[i]);
			if(idx==-1) continue; 
			sum+=(n-idx+1)*(pre[n]-pre[idx-1]); 
		}
		return sum;
	}
int main(){
	cin>>n>>m>>s;
	for(int i=1;i<=n;i++) cin>>a[i].w>>a[i].v;
	for(int i=1;i<=m;i++) cin>>l[i]>>r[i];
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++) pre[i]=pre[i-1]+a[i].v;
	ll L=0,R=a[n].w+1; 
	while(L<=R){
		ll mid=(L+R)>>1;
		ll x=check(mid);
		if(x>s){
			ans=min(x-s,ans);
			L=mid+1;
		}else if(x==s){
			cout<<0;
			return 0;
		}else{
			ans=min(ans,s-x);
			R=mid-1;
		}
	}
	cout<<ans;
	return 0;
}