#include "mosaic.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
#define LC (v<<1)
#define RC (v<<1|1)
#define mid ((l+r) >> 1)
std::vector<long long> mosaic(std::vector<int> X, std::vector<int> Y, std::vector<int> T, std::vector<int> B, std::vector<int> lo, std::vector<int> hi) {
int n = X.size();
int q = (int)T.size();
if (n==1) return vector<ll> (q, X[0]);
vector<ll> ans(q);
vector<int> all(q);
iota(all.begin(), all.end(), 0);
sort(all.begin(), all.end(), [&](int i, int j) {
return T[i]<T[j];
});
auto it = all.begin();
vector<ll> a;
for (int i=1; i<n; i++) a.pb(X[i]);
for (int i = n-2; 0<=i; i--) a[i] += a[i+1];
auto get = [&](int l, int r) {
if (r+1 == a.size()) return a[l];
return a[l] - a[r+1];
};
for (int r=0; r<2; r++) {
while (it!=all.end() && T[*it]==r) {
int L = lo[*it];
int R = hi[*it];
if (L==0) ans[*it] = Y[r], L++;
L--, R--;
if (L<=R) ans[*it] += get(L, R);
it++;
}
if (r+1 != n) {
vector<ll> b;
b.pb((Y[r+1]|get(0, 0))^1);
for (int i=1; i<a.size(); i++) b.pb((b.back()|get(i, i))^1);
swap(a, b);
for (int i = n-2; 0<=i; i--) a[i] += a[i+1];
}
}
{
vector<ll> b = a;
a.clear();
for (int i=0; i<n; i++) a.pb(0);
for (int i:b) a.pb(i);
}
int z=n;
for (int r=2; r<n; r++) {
while (it!=all.end() && T[*it]==r) {
int L = lo[*it];
int R = hi[*it];
if (L==0) ans[*it] = Y[r], L++;
L--, R--;
if (L<=R) ans[*it] += get(z+L, z+R);
it++;
}
if (r+1 != n) {
z--;
int t = (Y[r+1]|a[z+1])^1;
if (z+2 < a.size()) a[z+1] = ((get(z+2, z+2)|t) ^ 1) + a[z+2];
a[z] = t + a[z+1];
}
}
return ans;
}
