#include "bits/stdc++.h"

#include <unordered_map>
//#include <iostream>//POJ
//#include <vector>
//#include <string>
//#include <iomanip>
//#include <math.h>
using namespace std;
#define setc cin.tie(0);ios::sync_with_stdio(0)
#define repi(i,a,b) for(int i=(a), i##_len=(b); i<i##_len; ++i)
#define rep(i,n) repi(i,0,n)
#define repi_(i,a,b) for(int i=(a), i##_len=(b); i<=i##_len; ++i)
#define rep_(i,n) repi_(i,0,n)
#define all(x) (x).begin(),(x).end()
#define vsort(v) sort((v).begin(), (v).end())
#define gsort(v) tsort(v); reverse((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
template<typename T> T vpop(vector<T> *v) {
	T res = v->back();
	v->pop_back();
	return res;
}
char vpop(string *v) {
	char res = v->back();
	v->pop_back();
	return res;
}
#define siz(v) ((int)(v).size())
#define ers(v, n) (v).erase((v).begin() + n)
#define cnt(v, n) count(all(v), n)
#define vmin(v) *min_element(v.begin(), v.end())
#define vmax(v) *max_element(v.begin(), v.end())
#define contain(q) !q.empty()
#define cont(q) !q.empty()
//#define qpop(q, a, b) a=q.back().first;b=q.back().second;q.pop()
//#define pqpop(p, a, b) a=q.top().first;b=q.top().second;q.pop()
#define el "\n"
#define sp " "
#define co(x) cout<<(x)<<el
#define coc(c, a, b) if(c)co((a));else co((b))
#define cosp(x) cout<<(x)<<' '
#define YES(c) coc(c,"YES", "NO")
#define Yes(c) coc(c,"Yes", "No")
#define yes(c) coc(c,"yes", "no")
#define POSSIBLE(c) coc(c, "POSSIBLE", "IMPOSSIBLE")
#define Possible(c) coc(c, "Possible", "Impossible")
#define possible(c) coc(c, "possible", "impossible")
#define inf INT_MAX
#define wildcard(T) numeric_limits<T>::min()

#define pb push_back
#define pq priority_queue
#define np next_permutation

#ifdef tqktmp_2
#define gc() getchar(); getchar()
#else
#define gc() 1
#endif
const unsigned int bf0 = (1 << 0);
const unsigned int bf1 = (1 << 1);
const unsigned int bf2 = (1 << 2);
const unsigned int bf3 = (1 << 3);
const unsigned int bf4 = (1 << 4);
const unsigned int bf5 = (1 << 5);
const unsigned int bf6 = (1 << 6);
const unsigned int bf7 = (1 << 7);

typedef long long lint;
typedef vector<int> ivec; typedef vector<string> svec;
typedef vector<lint> lvec;
typedef vector<vector<int>> ivvec;
typedef pair<int, int> P;

const int
	dx8[8] = { 0,1,1,1,0,-1,-1,-1 },
	dy8[8] = { 1,1,0,-1,-1,-1,0,1 },
	dx4[4] = { 0,1,0,-1 },
	dy4[4] = { 1,0,-1,0 };

template<class T>inline bool maxi(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool mini(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }




//double a[6];
//char f[6] = {};
//
//svec strans;
//string sans;
//char ans[6];
//int order[6], cp;
//
//
//
//void ansord2sans() {
//	sans = "(((((( ";
//	rep(i, 6) {
//		sans += ans[order[i]] + to_string((int)a[order[i]]) + ")";
//	}
//	strans.pb(sans);
//}
//
//bool dfs(double cur, int len) {
//	bool ret = 0;
//	if (len == 6) {
//		if (cur == 100) {
//			rep(i, 6)ans[i] = f[i];
//			ansord2sans();
//			return 1;
//		}
//		return 0;
//	}
//	//+, -, * , /
//	cp = order[len];
//	rep(i, 6) if(!f[i]){
//		order[len] = i;
//		f[i] = '+';
//		if (dfs(cur + a[i], len + 1)) ret = 1;
//		f[i] = '-';
//		if (dfs(cur - a[i], len + 1)) ret = 1;
//		if(len){
//			f[i] = '*';
//			if (dfs(cur * a[i], len + 1)) ret = 1;
//			f[i] = '/';
//			if (dfs(cur / a[i], len + 1)) ret = 1;
//		}
//		f[i] = 0;
//		
//	}
//	order[len] = cp;
//	return ret;
//}
//
//int main() {
//	setc;
//
//	cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> a[5];
//	Yes(dfs(0, 0));
//	co("There are "+to_string(siz(strans))+" ways to make 100 with Four arithmetic operations: ");
//	rep(i, siz(strans)) {
//		co(strans[i]);
//	}
//	gc();
//}


int main() {
	setc;

	lint n,m, ans=0;cin>>n>>m;
	unordered_map<lint,lint> ma;
	lint in, s=0;//累積和%m
	ma[0]=1;
	rep(i, n) {
		cin>>in;
		s=(s+in)%m;
		++ma[s];
	}
	for (auto i : ma) {
		ans += i.second*(i.second-1)/2;
	}
	co(ans);
}



Measured memory_bytes: 3724