#include <bits/stdc++.h>
#define ll long long
#define N 200011
using namespace std;
int a[4][N],b[N][4],val[N*2],n;
ll sum[N*2],sumi[N*2];
ll S2(int i,int j)
{
	if(i<0||j<0)return 0;
	if(j<=2)return b[i][j];
	if(i<=2)return a[i][j];
	return b[i][2]+a[2][j]-a[2][2];
}
ll query(int i,int j)
{
	ll ans=S2(i,j);
	// printf("first ans:%lld\n",ans);
	if(i>=3&&j>=3)
	{
		int x1=3-i+n,x2=n,x3=j-i+n,x4=j-3+n;
		if(x2>x3)swap(x2,x3);
		int str=min(i,j)-2;
		ans+=(sumi[x2]-sumi[x1-1])-1ll*(x1-1)*(sum[n]-sum[x1-1]);
		ans+=1ll*str*(sum[x3]-sum[x2]);
		ans+=1ll*(x4+1)*(sum[x4]-sum[x3])-(sumi[x4]-sumi[x3]);
	}
	// printf("query(%d,%d):%lld\n",i,j,ans);
	return ans;
}
vector<ll> mosaic(vector<int> X,vector<int> Y,vector<int> U,vector<int> D,vector<int> L,vector<int> R)
{
	n=max((int)X.size(),3);
	for(int i=0;i<n;++i)a[1][i+1]=X[i];
	for(int i=0;i<n;++i)b[i+1][1]=Y[i];
	for(int i=2;i<=3;++i)a[i][1]=b[i][1],b[1][i]=a[1][i];
	for(int i=2;i<=3;++i)
	{
		for(int j=2;j<=n;++j)a[i][j]=!(a[i-1][j]|a[i][j-1]);
	}
	for(int i=2;i<=n;++i)
	{
		for(int j=2;j<=3;++j)b[i][j]=!(b[i-1][j]|b[i][j-1]);
	}
	for(int i=3;i<=n;++i)val[i-3+n]=a[3][i],val[3-i+n]=b[i][3];
	// printf("val:");for(int i=3-n+n;i<=n-3+n;++i)printf("%d ",val[i]);putchar(10);
	for(int i=1;i<=2*n;++i)sum[i]=sum[i-1]+val[i],sumi[i]=sumi[i-1]+1ll*val[i]*i;
	for(int i=1;i<=3;++i)for(int j=1;j<=n;++j)a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
	for(int i=1;i<=n;++i)for(int j=1;j<=3;++j)b[i][j]+=b[i-1][j]+b[i][j-1]-b[i-1][j-1];
	int q=U.size();
	vector<ll> ans;
	for(int i=0;i<q;++i)
	{
		++U[i];++D[i];++L[i];++R[i];
		ans.push_back(query(D[i],R[i])-query(U[i]-1,R[i])-query(D[i],L[i]-1)+query(U[i]-1,L[i]-1));
	}
	return ans;
}