#include <iostream>
#include <fstream>

using namespace std;

int a, i, j, b, n, k, r, v[500100];
long long s[500100];

int main()
{
	ifstream f("divk.in");
	ofstream g("divk.out");

	f >> n >> k >> a >> b;
	for (i = 1; i <= n; i++)
	{
		f >> v[i];
		s[i] = s[i - 1] + v[i];
	}
	for (i = 1; i <= n; i++)
	{
		for (j = i + a; j <= i + b; j++)
		{
			if ((s[j] - s[i - 1]) % k == 0)
				r++;
		}
	}
	g << r - 1;
	return 0;
}