# Middle of Three Figures

Easy

1

31.3% Acceptance

Create a program that reads sets of three distinct numbers and determines the **second-highest number** within each set.

## Data Input

- The initial line denotes the total count of number sets, labeled as $N$.
- Following this, $N$ lines appear, each containing three integers separated by spaces.

## Expected Output

For every set of the $N$ provided, produce a line showcasing the second-highest number from the three given integers.

## Constraints

- 1 ≤ $N$ ≤ 6
- Each integer falls within the range of 1 to 10000
- Each set comprises three unique integers, ensuring no repetitions.

## Example

### Scenario #1:

Input:

`3 1 2 3 10 15 5 100 999 500`

Output:

`2 10 500`