#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

void yes() { cout << "Yes" << endl; exit(0); }
void no() { cout << "No" << endl; exit(0); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> void amax(T &x, T y) { x = max(x, y); }
template <typename T> void amin(T &x, T y) { x = min(x, y); }
template <typename T> T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

const int INF = 1001001001;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};

struct S {
  using P = pair<int, int>;
  set<P> s;
  S() {
    s.emplace(0, INF);
    s.emplace(INF, 0);
  }
  i64 get(P p) {
    auto it = s.lower_bound(p);
    auto jt = s.lower_bound(p);
    it--, jt++;
    i64 x = p.first - it->first;
    i64 y = p.second - jt->second;
    return x * y;
  }
  i64 add(int x, int y) {
    P p(x, y);
    auto it = s.lower_bound(p);
    if (it->second >= y) return 0;
    it--;
    i64 ret = 0;
    while (true) {
      if (it->second <= y) {
        ret -= get(*it);
        s.erase(it--);
      } else {
        break;
      }
    }
    s.insert(p);
    ret += get(p);
    return ret;
  }
};

void solve() {
  int n;
  cin >> n;
  S a, b, c, d;
  rep(i, n) {
    int xa, ya, xb, yb;
    cin >> xa >> ya >> xb >> yb;
    xa *= -1;
    ya *= -1;
    i64 ans = 0;
    ans += a.add(xa, ya);
    ans += b.add(xa, yb);
    ans += c.add(xb, ya);
    ans += d.add(xb, yb);
    cout << ans << endl;
  }
}