# Distance Statistics

Time Limit: 2000MS

Memory Limit: 64000K

## Description

Frustrated at the number of distance queries required to find a reasonable route for his cow marathon, FJ decides to ask queries from which he can learn more information. Specifically, he supplies an integer K (1 <= K <= 1,000,000,000) and wants to know how many pairs of farms lie at a distance at most K from each other (distance is measured in terms of the length of road required to travel from one farm to another). Please only count pairs of distinct farms (i.e. do not count pairs such as (farm #5, farm #5) in your answer).

## Input

* Lines 1 ..M+1: Same input format as in "Navigation Nightmare" * Line M+2: A single integer, K.

## Output

* Line 1: The number of pairs of farms that are at a distance of at most K from each-other.

## Sample Input

7 6
1 6 13 E
6 3 9 E
3 5 7 S
4 1 3 N
2 4 20 W
4 7 2 S
10


## Sample Output

5


## Hint

There are 5 roads with length smaller or equal than 10, namely 1-4 (3), 4-7 (2), 1-7 (5), 3-5 (7) and 3-6 (9).

## Source

USACO 2004 February