#include <fstream>

using namespace std;
ifstream fin ("divk.in");
ofstream fout ("divk.out");
int main()
{
    int n,a,b,k,i,v[500007],s[500007],nr,j;
    fin>>n>>k>>a>>b;
    s[0]=0;
    for (i=1;i<=n;i++)
    {
        fin>>v[i];
        s[i]=s[i-1]+v[i];
    }
    nr=0;
    for(i=1;i<=n;i++)
    {
        for (j=i+1;j<=n;j++)
        {

            if(((s[j]-s[i-1])%k==0)&&j-i+1>=a&&j-i+1<=b)
                nr++;
        }

    }
    fout<<nr;
    return 0;
}