#include<bits/stdc++.h>
using namespace std;
using ll = long long;
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<int>> arr(n, vector<int>(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;
}
}
}
int q = T.size();
for (int _ = 0; _ < q; _++){
int cnt = 0;
for (int i = T[_]; i <= B[_]; i++){
for (int j = L[_]; j <= R[_]; j++){
cnt += arr[i][j];
}
}
ans.push_back(cnt);
}
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;
// }
