import java.util.*;
import java.lang.*;
import java.io.*;

class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in) ; 
		//taking inputes
		int n = sc.nextInt() ; 
		
		int k1 = sc.nextInt() ; 
		int k2 = sc.nextInt() ; 
		
		
		int arr[] = new int[n] ; 
		
		for(int i = 0 ; i < n ; i++) {
		    arr[i] = sc.nextInt() ; 
		}
		
		
		//O(n^3) solution better than brute force 
		
		// arr[i] + arr[j] > k1 && arr[k] + arr[l] > k2 ; 
		int count = 0 ; 
		for(int i = 0 ; i < n ; i++) {
		    for(int j = i + 1 ; j < n ; j++) {
		        if(arr[i] + arr[j] > k1) {
		            int start = j + 1 ; int end = n-1 ; 
		            int c = 0  ; 
		            while(start < end) {
		                if(arr[start] + arr[end] > k2) {
		                    c += end - start ; 
		                    end-- ; 
		                }else{
		                    start++ ; 
		                }
		            }
		            count += c ; 
		        }
		    }
		}
		
		System.out.println(count);

	}
}