#include "mosaic.h"
#include<iostream>
#include<algorithm>
#include<vector>
#include<utility>
using namespace std;
typedef long long ll;
std::vector<long long> mosaic(std::vector<int> X, std::vector<int> Y, std::vector<int> T, std::vector<int> B, std::vector<int> L, std::vector<int> R){
int n = (int)X.size();
int q = (int)T.size();
vector<vector<int>> dp(n, vector<int>(n));
for(int i = 0; i < n; i++){
dp[0][i] = X[i];
}
for(int i = 0; i < n; i++){
dp[i][0] = Y[i];
}
for(int i = 1; i < min(5, n); i++){
for(int j = 1; j < n; j++){
if(dp[i - 1][j] == 0 && dp[i][j - 1] == 0) dp[i][j] = 1;
}
}
for(int i = 1; i < min(5, n); i++){
for(int j = 1; j < n; j++){
if(dp[j - 1][i] == 0 && dp[j][i - 1] == 0) dp[j][i] = 1;
}
}
for(int i = 5; i < n; i++){
for(int j = 5; j < n; j++){
dp[i][j] = dp[i - 1][j - 1];
}
}
/*for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++) cout << dp[i][j] << " ";
cout << endl;
}*/
vector<ll> ans(q);
for(int i = 0; i < q; i++){
for(int j = T[i]; j <= B[i]; j++){
for(int k = L[i]; k <= R[i]; k++){
ans[i] += dp[j][k];
}
}
}
return ans;
}
