#include <fstream>
#include <bitset>

using namespace std;
ifstream in ("divk.in");
ofstream out("divk.out");
int v[1000000], k, a, b, i, n, f[100009];
long long sol;

int main()
{
    in >> n >> k >> a >> b;
    for ( i=1;  i <= n; i++ ){
        in>>v[i];
        v[i] += v[i-1];
        v[i] %= k;
    }
    for ( i=a; i <= n; i++ ){
        f[ v[i-a] ] ++;
        if ( i>b ) f[ v[i-b-1] ]--;
        sol += f[v[i]];
    }
    out<<sol;
    return 0;
}