#include <fstream>
using namespace std;
ifstream fin ("divk.in");
ofstream fout ("divk.out");
int N, K, A, B, sol, V[500010];

int main()
{
	fin >> N >> K >> A >> B;
	for (int i = 1; i <= N; i++) {
		fin >> V[i];
		V[i] = (V[i] + V[i - 1]) % K;
	}
		
	for (int i = A; i <= B; i++)
	{
		for (int j = i; j <= N; j++)
		{
			if (V[j] == V[j - i]) sol++;
		}
	}
	
	fout << sol << '\n';
	fout.close();
	return 0;
}