#include<bits/stdc++.h>
#define fi first
#define se second
#define mk make_pair
#define pub emplace_back
#define pob pop_back
using namespace std;
typedef long long ll;
const int V=1e9;
const int N=2e5+10;
const ll inf=0x3f3f3f3f3f3f3f3f;
int rt[N];
//remember to clean all these things
struct SGT{
	struct T{
		int ls,rs;
		int sum;
	}t[N*30];int ts;
	int ins(int p,int l,int r,int x){
		int nw=++ts;t[nw]=t[p];
		if(l==r) return t[nw].sum++,nw;
		int mid=l+r>>1;
		if(x<=mid) t[nw].ls=ins(t[p].ls,l,mid,x);
		else t[nw].rs=ins(t[p].rs,mid+1,r,x);
		t[nw].sum=t[t[nw].ls].sum+t[t[nw].rs].sum;
		return nw;
	}
	int ask(int p,int l,int r,int x,int y){
		if(!p) return 0;
		if(x<=l&&r<=y) return t[p].sum;
		int mid=l+r>>1,res=0;
		if(x<=mid) res+=ask(t[p].ls,l,mid,x,y);
		if(y>mid) res+=ask(t[p].rs,mid+1,r,x,y);
		return res;
	}
}t;
int val[N],vals;
int to[N],fr[N];
set<pair<int,int>> s1,s2;
ll dp[N];
int w(int x,int y){
	x=lower_bound(val+1,val+1+vals,V-(x+1)+1)-val;
	y--;
	return t.ask(rt[x],0,V,0,y);
}
struct Q{
	struct Node{int l,r,x,v;};
	vector<Node> q;int mul;
	int pos;
	#define top (int)q.size()-1
	ll calc(int id,int x,int y){
		return x>y?inf:dp[id]+(ll)w(x,y)*mul;
	}
	void ins(int x,int v){
		if(dp[x]==inf) return;
		while(!q.empty()&&calc(q[top].x,q[top].v,q[top].l)>=calc(x,v,q[top].l)) q.pob();
		if(q.empty()){
			q.pub((Node){v,V+1,x,v});
			return;
		}
		if(calc(q[top].x,q[top].v,q[top].r)<calc(x,v,q[top].r)){
			if(q[top].r<=V) q.pub((Node){q[top].r+1,V,x,v});
			return;
		}
		int l=q[top].l+1,r=q[top].r,mid;
		while(l<r){
			mid=l+r>>1;
			if(calc(q[top].x,q[top].v,mid)>=calc(x,v,mid)) r=mid;
			else l=mid+1;
		}
		q[top].r=l-1;
		q.pub((Node){l,V+1,x,v});
	}
	ll ask(int nwv){
		while(pos+1<=top&&q[pos+1].l<=nwv) pos++;
		return pos<=top?calc(q[pos].x,q[pos].v,nwv):inf;
	}
	#undef top
}tt[N];
long long solve(int n, int m, int tot, std::vector<int> T,
                std::vector<int> X, std::vector<int> Y,
                std::vector<int> A, std::vector<int> B, std::vector<int> C,
                std::vector<int> L, std::vector<int> R){
	t.ts=0;
	auto init=[&](){
		vals=0;
		for(int &x:L) x=V-x+1,val[++vals]=x;
		for(int x:B) val[++vals]=V-(x+1)+1;
		val[++vals]=V-(0+1)+1;
		sort(val+1,val+1+vals);
		vals=unique(val+1,val+1+vals)-val-1;
		for(int &x:L) x=lower_bound(val+1,val+1+vals,x)-val;
		static vector<int> v[N];
		for(int i=1;i<=vals;i++) v[i].clear();
		for(int i=0;i<tot;i++) v[L[i]].pub(R[i]);
		for(int i=1;i<=vals;i++){
			rt[i]=rt[i-1];
			for(int x:v[i]) rt[i]=t.ins(rt[i],0,V,x);
		}
	};
	init();
	s1.clear();s2.clear();
	to[0]=1;
	s1.insert(mk(0,0));
	fr[m+1]=n;
	s2.insert(mk(V+1,m+1));
	for(int i=1;i<=m;i++){
		to[i]=Y[i-1]+1;
		fr[i]=X[i-1]+1;
		s1.insert(mk(B[i-1],i));
		s2.insert(mk(A[i-1],i));
	}
	memset(dp,0x3f,sizeof(ll)*(m+2));
	dp[0]=0;
	for(int i=1;i<=n;i++) tt[i].mul=T[i-1],tt[i].q.clear(),tt[i].pos=0;
	auto it1=s1.begin();
	for(auto it2:s2){
		while(it1!=s1.end()&&it1->fi<=it2.fi){
			int x=it1->se,v=it1->fi;
			tt[to[x]].ins(x,v);
			it1++;
		}
		int x=it2.se,v=it2.fi;
		dp[x]=tt[fr[x]].ask(v);
		if(x==m+1) break;
		if(dp[x]<inf) dp[x]+=C[x-1];
	}
	ll ans=dp[m+1];
	if(ans<inf) return ans;
	else return -1;
}