//divk
#include<bits/stdc++.h>
#define debug cerr<<"ok";
#define MAXN 50000
using namespace std;

int n,k,a,b,i,j,S[MAXN];

int main ()
{
    freopen("divk.in","r",stdin);
    freopen("divk.out","w",stdout);
    scanf("%d%d%d%d",&n,&k,&a,&b);
    for(i=0;i<n;i++)
        scanf("%d",&S[i]), S[i]= (S[i]+S[i-1])%k;
    int cnt=0;
    for(i=0;i<n-1;i++){
        for(j=i+1;j<n;j++)
            if(S[i] == S[j])
                cnt++;
    }
    cout <<cnt;
    return 0;
}