#include<bits/stdc++.h>
#define reg register
#define int long long
inline bool cmax(reg int &x,reg int y){return x<y?x=y,1:0;}
inline int max(reg int x,reg int y){return x>y?x:y;}
const int N=4e5+10;
int n,ans=-1e18,sum[N];
std::vector<std::tuple<int,int,int>> vc1[N],vec[N],vc2[N];
int mx[N<<2],tag1[N<<2],tag2[N<<2],mx1[N<<2],mx2[N<<2];
inline void brush1(reg int o,reg int k){tag1[o]+=k,mx1[o]+=k,mx[o]+=k;}
inline void brush2(reg int o,reg int k){tag2[o]+=k,mx2[o]+=k,mx[o]+=k;}
inline void pushdown(reg int o){
	if (tag1[o]) brush1(o<<1,tag1[o]),brush1(o<<1|1,tag1[o]),tag1[o]=0;
	if (tag2[o]) brush2(o<<1,tag2[o]),brush2(o<<1|1,tag2[o]),tag2[o]=0;
}
inline void pushup(reg int o){
	mx[o]=max(max(mx[o<<1],mx[o<<1|1]),mx1[o<<1|1]+mx2[o<<1]);
	mx1[o]=max(mx1[o<<1],mx1[o<<1|1]),mx2[o]=max(mx2[o<<1],mx2[o<<1|1]);
}
void modify1(reg int o,reg int l,reg int r,reg int L,reg int R,reg int k){
	if (L>R) return; if (L<=l&&r<=R) return brush1(o,k); reg int mid=l+r>>1; pushdown(o);
	if (L<=mid) modify1(o<<1,l,mid,L,R,k); if (R>mid) modify1(o<<1|1,mid+1,r,L,R,k); pushup(o);
}
void modify2(reg int o,reg int l,reg int r,reg int L,reg int R,reg int k){
	if (L>R) return; if (L<=l&&r<=R) return brush2(o,k); reg int mid=l+r>>1; pushdown(o);
	if (L<=mid) modify2(o<<1,l,mid,L,R,k); if (R>mid) modify2(o<<1|1,mid+1,r,L,R,k); pushup(o);
}
void build(reg int o,reg int l,reg int r){
	mx1[o]=tag1[o]=tag2[o]=0,mx[o]=-1e18; if (l==r) return mx2[o]=sum[l],void(); 
	reg int mid=l+r>>1; build(o<<1,l,mid),build(o<<1|1,mid+1,r); pushup(o);
}
#undef int
long long get_max_score(int W, int H, std::vector<int> A, std::vector<int> X1, std::vector<int> Y1, std::vector<int> X2, std::vector<int> Y2){
	#define int long long
	n=A.size(),W<<=1,H<<=1;
	for (reg int i=0;i<n;i++){
		X1[i]<<=1,Y1[i]<<=1,X2[i]<<=1,Y2[i]<<=1; 
		if (X1[i]>X2[i]) std::swap(X1[i],X2[i]); if (Y1[i]>Y2[i]) std::swap(Y1[i],Y2[i]);
	}
	for (reg int i=0;i<n;i++) sum[Y1[i]]+=A[i],sum[Y2[i]+1]-=A[i];
	for (reg int i=1;i<=H;i++) sum[i]+=sum[i-1];
	// for (reg int i=0;i<=H;i++) std::cerr<<sum[i]<<" "; std::cerr<<"\n";
	auto solve=[&]()->void {
		build(1,0,H); for (reg int i=0;i<=W;i++) vc1[i].clear(),vc2[i].clear();
		for (reg int i=0;i<n;i++){
			vc1[X2[i]+1].push_back({Y1[i],Y2[i],A[i]});
			vc2[X1[i]].push_back({Y1[i],Y2[i],-A[i]});
			vc1[X1[i]].push_back({Y1[i],H,A[i]}),vc1[X2[i]+1].push_back({Y1[i],H,-A[i]});
			vc2[X1[i]].push_back({Y2[i]+1,H,-A[i]}),vc2[X2[i]+1].push_back({Y2[i]+1,H,A[i]});
		}
		for (reg int i=0;i<=W;i++){
			// std::cerr<<"<< "<<i<<"\n";
			for (auto [l,r,v]:vc1[i]) modify1(1,0,H,l,r,v);
			// std::cerr<<"\n";
			for (auto [l,r,v]:vc2[i]) modify2(1,0,H,l,r,v);
			
			// std::cerr<<mx[1]<<"\n";
			cmax(ans,mx[1]);
		}
	};
	solve();
	for (reg int i=0;i<n;i++) X1[i]=W-X1[i],X2[i]=W-X2[i],std::swap(X1[i],X2[i]);
	solve();
	return ans;
}