#include <bits/stdc++.h>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
  COMinit();
  long long n, m;
  cin >> n >> m;
  vector<long long> a(n), sum(n + 1);
  sum[0] = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    sum[i + 1] = (a[i] + sum[i]) % m;
  }
  map<long long, long long> b;
  set<long long> c;
  for (int i = 0; i <= n; ++i) {
    b[sum[i]]++;
    c.insert(sum[i]);
  }
  long long ans = 0;
  for (auto x : c) {
    ans += COM(b[x], 2);
  }
  cout << ans << endl;
}
