#include <bits/stdc++.h>

using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int n, a, b, k;
int v[500005];

void Read()
{
  f>>n>>k>>a>>b;
  f>>v[1];
  for(int i = 2;i <= n;++i)
    f>>v[i], v[i] += v[i - 1];
}

void Solve()
{
  int res = 0;
  for(int i = 1;i <= n - a + 1;++i)
    for(int j = i + a - 1;j <= i + b - 1;++j)
      if(j <= n)
        if((v[j] - v[i - 1]) % k == 0)
          ++res;
  g<<res;
}

int main()
{
  Read();
  Solve();
  return 0;
}