# Subsequence

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/32768 K (Java/Others)

## Description

There is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum element of the subsequence is no smaller than m and no larger than k.

## Input

There are multiple test cases.
For each test case, the first line has three integers, n, m and k. n is the length of the sequence and is in the range [1, 100000]. m and k are in the range [0, 1000000]. The second line has n integers, which are all in the range [0, 1000000].
Proceed to the end of file.

## Output

For each test case, print the length of the subsequence on a single line.

## Sample Input

5 0 0
1 1 1 1 1
5 0 3
1 2 3 4 5

## Sample Output

5
4

zhengfeng

## Source

2010 ACM-ICPC Multi-University Training Con