PROGRAMMING:Ring printing
As shown in the picture
![ Ring. PNG] (~ / 21842b2d-0577-4a0d-aacc-046088964e74. PNG)
Find the area of the shadow part of the two square rings (not necessarily regular rings, see the example) in the figure above and compare them.
###Input format:
In the first line, enter an integer $$1 / Leq T / Leq 2000 $$to represent the number of test data groups.
Each group of data input four lines, each line of four integers $$X, y, X_ 1, y_ 1 $$, ensure all input data $$0, Leq, x, y, X_ 1,y_ 1 \leq 1e9$$ , $$x < x_ 1 $$,$$y < y_ 1 $$;
There are four squares respectively $$a, B, C, D $$, which are small square $$a $$, large square $$B $$, small square $$C $$, large square $$d $$;
(guarantee that a is included by B and C is included by D)
###Output format:
Output an integer whose area is equal to.
###Input example:
```in
two
1 1 2 2
0 0 3 3
3 3 4 4
2 2 5 5
1 1 2 2
0 0 4 3
3 3 4 4
2 2 5 5
```
###Output example:
```out
fifteen
seventeen
```
answer:If there is no answer, please comment
![ Ring. PNG] (~ / 21842b2d-0577-4a0d-aacc-046088964e74. PNG)
Find the area of the shadow part of the two square rings (not necessarily regular rings, see the example) in the figure above and compare them.
###Input format:
In the first line, enter an integer $$1 / Leq T / Leq 2000 $$to represent the number of test data groups.
Each group of data input four lines, each line of four integers $$X, y, X_ 1, y_ 1 $$, ensure all input data $$0, Leq, x, y, X_ 1,y_ 1 \leq 1e9$$ , $$x < x_ 1 $$,$$y < y_ 1 $$;
There are four squares respectively $$a, B, C, D $$, which are small square $$a $$, large square $$B $$, small square $$C $$, large square $$d $$;
(guarantee that a is included by B and C is included by D)
###Output format:
Output an integer whose area is equal to.
###Input example:
```in
two
1 1 2 2
0 0 3 3
3 3 4 4
2 2 5 5
1 1 2 2
0 0 4 3
3 3 4 4
2 2 5 5
```
###Output example:
```out
fifteen
seventeen
```
answer:If there is no answer, please comment