#include<cstdio>
using namespace std;
long long n,k,a,b,i,s;
long long x[500001],rest[100001];
int main()
{
    freopen("divk.in","r",stdin);
    freopen("divk.out","w",stdout);
    scanf("%lld%lld%lld%lld",&n,&k,&a,&b);
    for (i=1;i<=n;++i)
    {
        scanf("%lld",&x[i]);
        x[i]=(x[i-1]+x[i])%k;
        if (i>=a)
        {
            ++rest[x[i-a]];
        }
        if (i>b)
        {
            --rest[x[i-b-1]];
        }
        s+=rest[x[i]];
    }
    printf("%lld\n",s);
    return 0;
}