Contest Duration: - (local time) (100 minutes) Back to Home
A - On the Way /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 制約

• 0\leq A,B,C\leq 100
• A,B,C は相異なる整数である

### 入力

A B C


### 出力

1 から家 2 まで寄り道をせずにまっすぐ向かう途中で家 3 のある座標を通る場合は Yes を、そうでない場合は No を出力せよ。

### 入力例 1

3 8 5


### 出力例 1

Yes


### 入力例 2

7 3 1


### 出力例 2

No


### 入力例 3

10 2 4


### 出力例 3

Yes


### 入力例 4

31 41 59


### 出力例 4

No


Score : 100 points

### Problem Statement

There are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively. Print Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.

### Constraints

• 0\leq A,B,C\leq 100
• A, B and C are distinct integers.

### Input

Input is given from Standard Input in the following format:

A B C


### Output

Print Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.

### Sample Input 1

3 8 5


### Sample Output 1

Yes


We pass the coordinate 5 on the straight way from the house at coordinate 3 to the house at coordinate 8.

### Sample Input 2

7 3 1


### Sample Output 2

No


### Sample Input 3

10 2 4


### Sample Output 3

Yes


### Sample Input 4

31 41 59


### Sample Output 4

No