PROGRAMMING:Heboost: the maximum and minimum problem of deleted sequences
Scholars in data statistics, in order to avoid the influence of extreme value, usually ignore the maximum and minimum value, and then make statistics on the remaining elements, please write a program to remove the extreme value.
###Input format:
A line of string, numbers are integers, separated by spaces (number of elements > = 3).
###Output format:
The remaining elements after removing extreme values at both ends are arranged in ascending order and separated by spaces
###Input example:
Here is a set of inputs. For example:
```in
10 3 2 -1 5 3 4 3 0 3 2
```
###Output example:
The corresponding output is given here. For example:
```out
0 2 2 3 3 3 3 4 5
```
answer：If there is no answer, please comment
###Input format:
A line of string, numbers are integers, separated by spaces (number of elements > = 3).
###Output format:
The remaining elements after removing extreme values at both ends are arranged in ascending order and separated by spaces
###Input example:
Here is a set of inputs. For example:
```in
10 3 2 -1 5 3 4 3 0 3 2
```
###Output example:
The corresponding output is given here. For example:
```out
0 2 2 3 3 3 3 4 5
```
answer：If there is no answer, please comment