#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200010], ans, sum[200010];
int n, m;
map<int, int> f;
inline int solve() {
	int ans = 0;
	f[0] = 1;
	for (int i = 1; i <= n; i++) {
		int k = sum[i] % m;
		if (f.count(k)) {
			ans += f[k];
		}
		f[k]++;
	}

	return ans;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i], sum[i] = sum[i - 1] + a[i];
	}
	cout << solve();
	return 0;
}

不知道问什么样例1 输出 $2$