#### Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

Manager K is designing a set of 3 posters to support Japan's delegates to this year's IOI. Each poster will contain one of the three characters 'J', 'O' and 'I'. Manager K has already designed the posters containing 'J' and 'I' and is now considering the design for the 'O' poster. Currently, he is considering possible designs of the poster with Australia's starry sky as a background.

The poster is of width **W** and height **H**. We will denote the coordinates of the bottom-left corner of the poster as (0, 0) and the upper-right corner as (**W**, **H**). There are **N** stars already printed on the poster. The **i**^{th} star **S _{i}** (1 ≤

**i**≤

**N**) is located on the poster at coordinates (

**X**,

_{i}**Y**). There do not exist two stars with the same coordinates.

_{i}Manager K is desigining the letter 'O' in the following manner. First, he picks four distinct stars **A**, **B**, **C** and **D** out of the **N** stars. The circle centered at **A** and passing through **B** will be denoted as **O _{1}** and the circle centered at

**C**and passing through

**D**will be denoted as

**O**. If the two circles

_{2}**O**and

_{1}**O**meet the following conditions, manager K will consider the choice as a possible candidate for the poster's design:

_{2}- Circle
**O**contains circle_{1}**O**. In other words, all points within circle_{2}**O**and on circle_{2}**O**'s perimeter are contained within the interior of circle_{2}**O**(which excludes circle_{1}**O**'s perimeter)._{1} - Both circles do not exceed the boundaries of the poster. In other words, all points (
**X**,**Y**) within each circle and on each circle's perimeter satisfy the conditions 0 ≤**X**≤**W**and 0 ≤**Y**≤**H**.

Given the locations of all the stars and the dimensions of the poster, determine how many distinct choices of four points A, B, C and D define a possible candidate for manager K's poster design.

### Input

Read from standard input.

- On the first line, there are three integers,
**N**,**W**and**H**.**N**represents the number of stars already printed on the poster.**W**and**H**represent the dimensions of the poster. - On the
**i**^{th}line of the next**N**lines, there are two integers,**X**and_{i}**Y**. This means that the_{i}**i**^{th}star**S**is located at the coordinates (_{i}**X**,_{i}**Y**)._{i}

### Output

Print one integer on one line to standard output, representing the number of distinct choices of four points define a possible candidate for manager K's poster design.

### Constraints

All test cases satisfy the following constraints:

- 4 ≤
**N**≤ 50. - 1 ≤
**W**≤ 1 000. - 1 ≤
**H**≤ 1 000. - 0 ≤
**X**≤_{i}**W**. - 0 ≤
**Y**≤_{i}**H**. - No two stars have the same coordinates.

### Subtasks

Subtask 1 (80 points):

- For any choice of stars
**A**,**B**,**C**and**D**that form a possible candidate, circle**O**and circle_{1}**O**do not intersect._{2}

Subtask 2 (20 points):

No further constraints.

### Sample Input 1

```
7 20 15
9 5
13 9
15 13
7 4
6 8
14 7
16 7
```

### Sample Output 1

```
3
```

### Explanation

This test case corresponds to the following diagram. Star **S _{i}** is represented by point

**i**.

The following three diagrams enumerate manager K's candidates for the poster design.

Note that in the three candidates, circles **O _{1}** and

**O**do not intersect.

_{2}### Sample Input 2

```
15 20 30
11 8
14 25
3 20
1 27
2 16
12 8
0 4
3 10
12 11
5 9
16 3
2 13
4 24
18 3
12 28
```

### Sample Output 1

```
12
```

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 10 | 5 | 0.5s | 256MB | Minimum |

2 | 10 | 5 | 0.5s | 256MB | Minimum |

3 | 10 | 5 | 0.5s | 256MB | Minimum |

4 | 10 | 5 | 0.5s | 256MB | Minimum |

5 | 10 | 5 | 0.5s | 256MB | Minimum |

6 | 10 | 5 | 0.5s | 256MB | Minimum |

7 | 10 | 5 | 0.5s | 256MB | Minimum |

8 | 10 | 5 | 0.5s | 256MB | Minimum |

9 | 10 | 5 | 0.5s | 256MB | Minimum |

10 | 10 | 5 | 0.5s | 256MB | Minimum |

11 | 0 | 2 | 0.5s | 256MB | Minimum |

### Judge Compile Command

g++-7 ans.cpp -o joi_poster -Wall -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512