#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("divk.in");
ofstream fout("divk.out");

int main()
{
    int n, a, b, k, v[500001], st=1, dr=1, l, s=0;
    fin>>n>>k>>a>>b;
    for (int i=1; i<=n; i++)
    {
        fin>>v[i];
    }
    for (int i=1; i<=n; i++)
    {
        v[i]=v[i-1]+v[i];
        v[i]=v[i]%k;
    }
    while (st<=n)
    {
        l=dr-st+1;
        if (v[dr]==v[st-1] and l<=b and l>=a)
        {
            s++;
        }
        dr++;
        if (dr>n)
        {
            st++;
            dr=st;
        }
    }
    fout<<s;

    return 0;
}