#include <fstream>

using namespace std;
ifstream f ("divk.in");
ofstream g ("divk.out");
unsigned long long n,k,a,b,i,j,v[500001],o,kk,t,s;
int main()
{
    f>>n>>k>>a>>b;
    for(i=1;i<=n;++i) {f>>v[i];v[i]+=v[i-1];}
    for(i=a;i<=b;++i)
    {
        for(j=i;j<=n;++j)
        {
            if((v[j]-v[j-i])%k==0) ++kk;
        }
    }
    g<<kk;
    f.close();
    g.close();
    return 0;
}