#include "mosaic.h"
#include <bits/stdc++.h>

const int kMaxN = 2e5 + 5;

int n, a[kMaxN], b[kMaxN];
std::unordered_map<int, int> op[kMaxN], cnt[kMaxN];

void prework() {
  for (int i = 1; i <= n; ++i)
    op[1][i] = a[i], op[i][1] = b[i];
  for (int i = 2; i <= std::min(n, 3); ++i)
    for (int j = 2; j <= (i <= 3 ? n : 3); ++j)
      op[i][j] = (!op[i - 1][j] && !op[i][j - 1]);
  for (int i = 1; i <= std::min(n, 3); ++i)
    for (int j = 1; j <= (i <= 3 ? n : 3); ++j)
      cnt[i][j] = op[i][j] + cnt[i][j - 1] + cnt[i - 1][j] - cnt[i - 1][j - 1];
}

int64_t query(int x, int y) {
  if (x <= 3 || y <= 3) return cnt[x][y];
}

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) {
  n = (int)X.size();
  for (int i = 1; i <= n; ++i) {
    a[i] = X[i - 1], b[i] = Y[i - 1];
  }
  prework();
  std::vector<long long> vec;
  for (int i = 0; i < (int)T.size(); ++i) {
    vec.emplace_back(query(B[i] + 1, R[i] + 1) - query(T[i], R[i] + 1) - query(B[i] + 1, L[i]) + query(T[i], L[i]));
  }
  return vec;
}