#include <bits/stdc++.h>

using namespace std;
ifstream in("divk.in");
ofstream out("divk.out");
long v[500008],f[100008];
int main()
{  long long a,i,b,k,n,ans=0;
  in>>n>>k>>a>>b;
    for(i=1;i<=n;i++)
        {in>>v[i]; v[i]=(v[i-1]+v[i])%k;}
   for(i=a;i<=n;i++)
   {  f[v[i-a]]++;
       if(i>b)
           f[v[i-b-1]]--;
       ans+=f[v[i]];
   }
   out<<ans;

    return 0;
}