#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll query(vector<vector<ll>> &pref, int upper_row, int lower_row, int left, int right){
ll v = 0;
v += pref[upper_row][right];
if (left != 0){
v -= pref[upper_row][left - 1];
}
if (lower_row != 0){
v -= pref[lower_row - 1][right];
}
if (left != 0 && lower_row != 0){
v += pref[lower_row - 1][left - 1];
}
return v;
}
vector<ll> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R){
vector<ll> ans;
int n = X.size();
vector<vector<ll>> arr(n, vector<ll>(n));
for (int i = 0; i < n; i++){
arr[i][0] = Y[i];
arr[0][i] = X[i];
}
for (int i = 1; i < n; i++){
for (int j = 1; j < n; j++){
if (arr[i - 1][j] == 0 && arr[i][j - 1] == 0){
arr[i][j] = 1;
}
else{
arr[i][j] = 0;
}
}
}
vector<vector<ll>> pref(n + 1, vector<ll>(n + 1, 0));
pref[0][0] = arr[0][0];
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
if (i == 0 && j == 0){continue;}
if (i == 0){
pref[i][j] = pref[i][j - 1] + arr[i][j];
}
else if (j == 0){
pref[i][j] = pref[i - 1][j] + arr[i][j];
}
else{
pref[i][j] = arr[i][j] + pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
}
}
}
int q = T.size();
for (int k = 0; k < q; k++){
ans.push_back(query(pref, B[k], T[k], L[k], R[k]));
}
return ans;
}
// int main(){
// vector<ll> ans = mosaic({1, 0, 1, 0}, {1, 1, 0, 1}, {0, 2}, {3, 3}, {0, 0}, {3, 2});
// for (auto &p: ans){
// cout << p << "\n";
// }
// return 0;
// }
