#include <bits/stdc++.h>
using namespace std;
string to_string(vector<int> numbers) {
string text = "{";
for (auto i = numbers.begin(); i != numbers.end(); i++) {
text += to_string(*i);
//if (next(i) != numbers.end()) {text += ", "}
} text += '}';
return text;
}
string to_string(vector<vector<int>> numbers) {
string text = "";
for (auto i = numbers.begin(); i != numbers.end(); i++) {
text += to_string(*i);
if (next(i) != numbers.end()) {text += "\n";}
} // text += '}';
return text;
}
vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) {
int n = X.size(), q = T.size();
vector<vector<int>> hormatrix(3, vector<int>(n)), vermatrix(n, vector<int>(3));
hormatrix[0] = X;
for (int i = 0; i <= 2; i++) {
hormatrix[i][0] = Y[i];
} for (int i = 1; i <= 2; i++) {
for (int j = 1; j < n; j++) {
if (hormatrix[i - 1][j] == 0 && hormatrix[i][j - 1] == 0) {
hormatrix[i][j] = 1;
} else {hormatrix[i][j] = 0;}
}
} for (int j = 0; j <= 2; j++) {
vermatrix[0][j] = X[j];
} for (int i = 0; i < n; i++) {
vermatrix[i][0] = Y[i];
} for (int i = 1; i < n; i++) {
for (int j = 1; j <= 2; j++) {
if (vermatrix[i - 1][j] == 0 && vermatrix[i][j - 1] == 0) {
vermatrix[i][j] = 1;
} else {vermatrix[i][j] = 0;}
}
}
vector<vector<int>> hormatrixprefix(3, vector<int>(n + 1, 0));
for (int i = 0; i <= 2; i++) {
hormatrixprefix[i][0] = 0;
for (int j = 1; j < n + 1; j++) {
hormatrixprefix[i][j] = hormatrixprefix[i][j - 1];
if (hormatrix[i][j - 1] == 1) {hormatrixprefix[i][j]++;}
}
} vector<vector<int>> vermatrixprefix(3, vector<int>(n + 1, 0));
for (int j = 0; j <= 2; j++) {
vermatrixprefix[j][0] = 0;
for (int i = 1; i < n + 1; i++) {
vermatrixprefix[j][i] = vermatrixprefix[j][i - 1];
if (vermatrix[i - 1][j] == 1) {vermatrixprefix[j][i]++;}
}
} //cout << to_string(hormatrixprefix) << endl << to_string(vermatrixprefix) << endl << endl << endl;
vector<long long> answers;
for (int i = 0; i < q; i++) {
long long answ = 0;
int top = T[i], bottom = B[i], left = L[i], right = R[i];
if (top == bottom && left == right) {
if (top > 2 && left > 2) {
int minimum = min(top, left);
top -= minimum - 2;
left -= minimum - 2;
} if (top <= 2) {
answ = hormatrix[top][left];
} else if (left <= 2) {
answ = vermatrix[top][left];
}
}
else if (top == bottom) {
if (top <= 2) {
answ = hormatrixprefix[top][right + 1] - hormatrixprefix[top][left];
} else {
if (left == 0) {answ += vermatrix[top][0]; left++;}
if (left == 1 && right >= left) {answ += vermatrix[top][1]; left++;}
if (right >= left) {
int minimum = min(top, left);
top -= minimum - 2;
left -= minimum - 2;
right -= minimum - 2;
if (top == 2) {
answ += hormatrixprefix[top][right + 1] - hormatrixprefix[top][left];
} else {
int temp = max(3, top - (right - left));
int temp2 = max(0, right - left + 1 - (top - temp + 1));
answ += vermatrixprefix[2][top + 1] - vermatrixprefix[2][temp];
answ += hormatrixprefix[2][temp2 + 2] - hormatrixprefix[2][2];
}
}
}
}
answers.push_back(answ);
}
//cout << answ << endl;
//cout << to_string(hormatrix) << endl << endl << to_string(vermatrix);
return answers;
}
