#pragma GCC optimize("O3")
#include <fstream>
#include <iostream>
#include <vector>
#define NMAX 500000
#define KMAX 100000
#define inf 2000000000

using namespace std;

int n, k, a, b;
long long sum, sol;
vector <int> v[KMAX+10];

int cautbin(int line, int col, int c)
{   int val = v[line][col] + c, st = col+1, dr = v[line].size()-1;
    while(st < dr)
        {   int mij = (st + dr) / 2;
            if(v[line][mij] >= val) dr = mij;
            else st = mij+1;
        }
    return st;
}

void solve(int line)
{   v[line].push_back(inf);
    for(int i=0; i<v[line].size()-1; i++)
        {   int poz1 = cautbin(line, i, a), poz2 = cautbin(line, i, b+1);
            poz2--;
            if(poz2 >= poz1) sol = sol + (long long)poz2 - (long long)poz1 + 1;
        }
}

int main()
{
    ifstream cin("divk.in");
    ofstream cout("divk.out");
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> k >> a >> b;
    v[0].push_back(0);
    for(int i=1; i<=n; i++)
        {   long long x;
            cin >> x;
            sum += x;
            v[sum%k].push_back(i);
        }
    for(int i=0; i<k; i++) solve(i);
    cout << sol << '\n';
    return 0;
}