#include <algorithm>
#include<bits/stdc++.h>

using namespace std;


bool is_in_range(int x, int x1, int x2) {
    return min(x1, x2) <= x && x < max(x1, x2);
}

bool is_in(int x, int y, int x1, int y1, int x2, int y2) {
    bool ret = is_in_range(x, x1, x2) && is_in_range(y, y1, y2);
    return ret;
}

void solve() {

    int x1, y1, x2, y2;
    int xx1, yy1, xx2, yy2;
    cin >> x1 >> y1 >> x2 >> y2;
    cin >> xx1 >> yy1 >> xx2 >> yy2;
    vector<int> xv = {x1, x2, xx1, xx2}, yv = {y1, y2, yy1, yy2};
    sort(xv.begin(), xv.end());
    sort(yv.begin(), yv.end());
    typedef pair<int, int> pii;
    map<pii, pii> fa;
    auto find = [&](pii u) {
        while (u != fa[u]) u = fa[u] = fa[fa[u]];
        return u;
    };
    map<int, vector<pii>> kind;
    map<pii, int> kds;

    for (int i = 0; i < xv.size(); i++) {
        int xi = xv[i];
        for (int j = 0; j < yv.size(); j++) {
            fa[{i, j}] = {i, j};
            int yi = yv[j];
            int kd = 0;
            kd += is_in(xi, yi, x1, y1, x2, y2);
            kd += 2 * is_in(xi, yi, xx1, yy1, xx2, yy2);
            if (kd == 0)continue;
            kds[{i, j}] = kd;
            kind[kd].push_back({i, j});
        }
    }
    for (int i = 1; i <= 3; i++) {
        for (auto pt: kind[i]) {
            for (auto pt2: kind[i]) {
                if (abs(pt.first - pt2.first) + abs(pt.second - pt2.second) <= 1) {
                    fa[find(pt)] = find(pt2);
                }
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < xv.size(); i++) {
        for (int j = 0; j < yv.size(); j++) {
            if ((pii) {i, j} == find({i, j}) && kds[{i, j}] != 0) {
                ans++;
            }
        }
    }
    cout << ans+1 << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}