#include <bits/stdc++.h>
///N=500000
///K=100000
using namespace std;
///
ifstream fin("divk.in");
ofstream fout("divk.out");
///
typedef long long ll;
ll n, k, a, b, i, j, sol;
ll sum[500001], rest[100000];
///
int main()
{
    fin>>n>>k>>a>>b;
    for(i=1; i<=n; ++i){
        ll x;
        fin>>x;
        sum[i]=(sum[i-1]+x)%k;
        if(i>=a) ++rest[sum[i-a]];
        if(i>b) --rest[sum[i-b-1]];
        sol+=rest[sum[i]];
    }
    fout<<sol;
    fin.close();
    fout.close();
    return 0;
}