#include <fstream>

using namespace std;

ifstream ci ("divk.in");
ofstream co ("divk.out");

int main()
{
    int n,a,b,k;
    ci >> n >> k >> a >> b;
    int v[n+1];
    v[0]=0;
    for (int i=1; i<=n; i++)
    {
        ci >> v[i];
        v[i]=v[i]+v[i-1];
        v[i]=v[i]%k;
    }
    int r=0;
    for (int i=1; i<=n; i++)
    {
        for (int j=a; j<=b; j++)
        {
            if (v[i-1]==v[i+j])
                r++;
        }
    }
    co << r;
    return 0;
}