# PROBLEM LINK:

Practice

Contest: Division 1

Contest: Division 2

Contest: Division 3

Contest: Division 4

* Author:* utkarsh_25dec

*iceknight1093, rivalq*

**Testers:***iceknight1093*

**Editorialist:**# DIFFICULTY:

TBD

# PREREQUISITES:

None

# PROBLEM:

Given two ranges [A, B] and [C, D]; count the number of integers contained in their union.

# EXPLANATION:

Notice that the bounds on the ranges are quite small; between 1 and 8.

This means the union of the ranges is also a subset of \{1, 2, 3, 4, 5, 6, 7, 8\}.

So, for each integer from 1 to 8, check whether it belongs to one of the ranges.

That is, for each 1 \leq x \leq 8, check at least one of

- A \leq x \leq B; or
- C \leq x \leq D

is true.

The number of x satisfying this condition is the answer.

# TIME COMPLEXITY:

\mathcal{O}(1) per testcase.

# CODE:

## Code (Python)

```
for _ in range(int(input())):
a, b, c, d = map(int, input().split())
ans = 0
for i in range(1, 9):
if a <= i <= b or c <= i <= d: ans += 1
print(ans)
```