#include <cstdio>
using namespace std;

int Min,n,k,a,b,x,i,j,nr;
long long s[500003];
int main()
{
    freopen("divk.in", "r", stdin);
    freopen("divk.out", "w", stdout);
    scanf("%d", &n);
    scanf("%d%d%d", &k,&a,&b);
    for(i=1;i<=n;++i){
        scanf("%d", &x);
        s[i]=s[i-1]+(long long)x;
        if(a<=i){
            if(i<b) Min=i;
                else Min=b;
            for(j=a;j<=Min;++j)
                if((s[i]-s[i-j])%k==0) ++nr;
        }
    }
    printf("%d", nr);
    return 0;
}