PROGRAMMING:Looking for saddle point
This problem requires to find out the saddle point in the matrix of 3 rows and 4 columns, that is, the element in this position is the largest in this row and the smallest in this column. Note that there may be no saddle point( This problem assumes that all data are different, so there will only be one saddle point.)
###Input format:
Enter a matrix of 3 rows and 4 columns, separated by spaces.
###Output format:
If there is a saddle point, the saddle point value and its position are output;
If not, there is no saddle point in the output.
###Input sample 1:
```in
1 2 3 4
5 6 7 8
9 10 11 12
```
###Output sample 1:
```out
The saddle point is 4, in 0 rows and 3 columns
```
###Input sample 2:
```in
1 2 3 4
5 6 7 8
9 10 11 0
```
###Output sample 2:
```out
There is no saddle point
```
answer:If there is no answer, please comment
###Input format:
Enter a matrix of 3 rows and 4 columns, separated by spaces.
###Output format:
If there is a saddle point, the saddle point value and its position are output;
If not, there is no saddle point in the output.
###Input sample 1:
```in
1 2 3 4
5 6 7 8
9 10 11 12
```
###Output sample 1:
```out
The saddle point is 4, in 0 rows and 3 columns
```
###Input sample 2:
```in
1 2 3 4
5 6 7 8
9 10 11 0
```
###Output sample 2:
```out
There is no saddle point
```
answer:If there is no answer, please comment