#include <iostream>
#include <fstream>
using namespace std;
int main ()
{
 long long int v[5001];
 long int len = 0 , min , max , n , i , j , div , sb = 0 , lung;
 long long int suma ;
 fstream f("divk.in",ios::in);
 fstream g("divk.out",ios::out);
 f>> n >> div >> min >> max;
 for(i = 0 ; i < n ; i++ )
  f>>v[i];
 for( i = min ; i <= max ; i++ )
 {
  len = 0 ;        
  lung = i ;
  suma = 0;
  while ( len < i )
  {
   suma += v[len];
   len++;
  }
  if( suma % div == 0 )
   sb++;
  while ( len < n ) 
  {
   suma += v[len];
   suma -= v[ len - lung ];
   len++;
   if( suma % div == 0 )
    sb++;
  }
 }
 g<<sb;    
 f.close();
 g.close();
    return 0 ;
}