20140710 sequence

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <algorithm>

using namespace std;

const int maxn = 500005;
const int maxm = 500005;

int m,n;
int c[maxn];
int d[maxm];
long long ans;

int main() {
	//freopen("sequence.in","r",stdin);
	//freopen("sequence.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (int i = 1; i <= n; ++i) {
		scanf("%d",&c[i]);
		c[i] %= m;
		if (c[i]<0)
			c[i] += m;
		(c[i] += c[i-1]) %= m;
		ans += d[c[i]];
		++ d[c[i]];
	}
	ans += d[0];
	printf("%I64d\n", ans);
	return 0;
}