#include <bits/stdc++.h>

using namespace std;

ifstream in("divk.in");
ofstream out("divk.out");

using ll = long long;

const int maxN = (int)5e5;

int n, k, a, b;

int sum[maxN + 5], fr[maxN + 5];

int main() {
  in >> n >> k >> a >> b;
  for (int i = 1; i <= n; i++) {
    int x;
    in >> x;
    sum[i] = (sum[i - 1] + x) % k;
  }
  fr[0]++;
  ll result = (ll)0;
  for (int i = a; i <= n; i++) {
    result += (ll)fr[sum[i - a + 1]];
    fr[sum[i - a + 1]]++;
    if (i > b) {
      fr[sum[i - b]]--;
    }
  }
  out << result << "\n";
  return 0;
}