#include "mosaic.h"

#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=(1<<28)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int c1[205][N],c2[N][205],a[N],b[N];
int n,q;
ll sb1[N],sb2[N],sa1[N],sa2[N];
ll calc(int x,int y){
	if(x==-1||y==-1) return 0;
	if(x<=50) return c1[x][y];
	if(y<=50) return c2[x][y];
	ll tot=c1[49][y]+c2[x][49]-c1[49][49];
	int pb=x-y+50;
	if(pb<=50){
		tot+=(x+1)*sb1[x]-sb2[x];
	}else{
		tot+=(y-50+1)*sb1[pb]+(x+1)*(sb1[x]-sb1[pb])-(sb2[x]-sb2[pb]);
	}
	for(int i=50;i<=x;i++) tot+=b[i]*min(x-i+1,y-50+1);
	for(int i=50+1;i<=y;i++) tot+=a[i]*min(x-50+1,y-i+1);
	return tot;
}
vector<long long> mosaic(vector<int> X,vector<int> Y,vector<int> T,vector<int> B,vector<int> L,vector<int> R) {
	n=X.size();q=T.size();
	for(int i=0;i<n;i++) c1[0][i]=X[i],c2[i][0]=Y[i];
	for(int i=0;i<=200&&i<n;i++) c1[i][0]=Y[i],c2[0][i]=X[i];
	for(int i=1;i<=200;i++) for(int j=1;j<=n;j++) c1[i][j]=(!c1[i-1][j]&&!c1[i][j-1]);
	for(int i=1;i<=n;i++) for(int j=1;j<=200;j++) c2[i][j]=(!c2[i-1][j]&&!c2[i][j-1]);
	for(int i=50;i<=n;i++) a[i]=c1[50][i],b[i]=c2[i][50];
	for(int i=50;i<=n;i++) sb1[i]=sb1[i-1]+b[i],sb2[i]=sb2[i-1]+b[i]*i;
	for(int i=51;i<=n;i++) sa1[i]=sa1[i-1]+a[i],sa2[i]=sa2[i-1]+a[i]*i;
	for(int i=0;i<=200;i++) for(int j=0;j<=n;j++) if(i) c1[i][j]+=c1[i-1][j];
	for(int i=0;i<=200;i++) for(int j=0;j<=n;j++) if(j) c1[i][j]+=c1[i][j-1];
	for(int i=0;i<=n;i++) for(int j=0;j<=200;j++) if(i) c2[i][j]+=c2[i-1][j];
	for(int i=0;i<=n;i++) for(int j=0;j<=200;j++) if(j) c2[i][j]+=c2[i][j-1];
	vector<ll> ans(q);
	for(int i=0;i<q;i++){
		// for(int j=T[i];j<=B[i];j++) for(int h=L[i];h<=R[i];h++) ans[i]+=c2[j][h];
		ans[i]=calc(B[i],R[i])-calc(T[i]-1,R[i])-calc(B[i],L[i]-1)+calc(T[i]-1,L[i]-1);
	}
	return ans;
}