#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#define chmax(a,b) a = max(a,b)
#define chmin(a,b) a = min(a,b)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 6
#else
#define SIZE 123450
#endif

int N,xa,ya,xb,yb;
// y座標がiのmin,max
int D[SIZE][2];

void solve() {
    cin>>N;
    auto C = D+SIZE/2;
    REP(i,N) {
        scanf("%lld %lld %lld %lld", &xa, &ya, &xb, &yb);
        int cnt = 0;
        RFOR(y,1,yb+1) {
            int add = max(0LL, xb-C[y][1])+max(0LL, -xa+C[y][0]);
            chmin(C[y][0],xa);
            chmax(C[y][1],xb);
            if (add <= 0) break;
            cnt += add;
        }
        FOR(y,ya,0) {
            int add = max(0LL, xb-C[y][1])+max(0LL, -xa+C[y][0]);
            chmin(C[y][0],xa);
            chmax(C[y][1],xb);
            if (add <= 0) break;
            cnt += add;
        }
        out("%lld\n",cnt);
    }
}