The region which is guarded by two guards is considered strongly secured, the region which is guarded by exactly one guard is weakly secured, and the region which is guarded by no guard is unsecured.
In this problem, you have to find the area of strongly secured region, weakly secured region and unsecured region in meter^2 for every night.
Input will start with a line having a positive integer N (N ≤ 100), the number of nights Latif hires guards. For each of the N nights, there are two lines in input, first one defines the region of first guard and the second one defines the region of second guard. Each of this line will contain four integers x1, y1, x2, y2 (0 ≤ x1, y1, x2, y2 ≤ 100, x1 < x2, y1 < y2).
For each land you have to output one line, giving the night number followed by three integers: Area of strongly secured region, area of weakly secured region and area of unsecured region of Latif's land. See sample output for exact format.
Note: The picture below depicts the first sample input