#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
class UnionFind {
  vector<int> data;

 public:
  UnionFind(int size) : data(size, -1) {}
  bool unionSet(int x, int y) {
    x = root(x);
    y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y];
      data[y] = x;
    }
    return x != y;
  }
  bool findSet(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};
int find(vector<long long>& arr, long long obj) {
  if (arr[arr.size() - 1] < obj) return arr.size() - 1;
  if (arr[0] > obj) return -1;
  int min = 0;
  int max = arr.size() - 1;
  for (int i = 0; i < arr.size(); i++) {
    if (arr[min + (max - min) / 2] > obj) {
      max = min + (max - min) / 2;
    } else {
      min = min + (max - min) / 2;
    }
    if (max - min == 1) {
      return min;
    }
  }
}
void divisor(long long n, vector<long long>& ret) {
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      ret.push_back(i);
      if (i * i != n) ret.push_back(n / i);
    }
  }
  sort(ret.begin(), ret.end());
}
long long factorial(long long n, long long mod) {
  long long ret = 1;
  for (long long i = 1; i <= n; i++) {
    ret = (ret * i) % mod;
  }
  return ret;
}
long long inv_mod(long long n, long long mod) {
  long long a = n % mod, b = mod - 2, ret = 1;
  while (b > 0) {
    if (b & 1) ret = (ret * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return ret;
}
long long nPr(long long n, long long r, long long mod) {
  long long ret = 1;
  for (long long i = n; i >= n - r + 1; i--) {
    ret = ret * (i % mod) % mod;
  }
  return ret;
}
long long nCr(long long n, long long r, long long mod) {
  return nPr(n, r, mod) * inv_mod(factorial(r, mod), mod) % mod;
}
long long gcd(long long m, long long n) {
  if (n == 0) return m;
  return gcd(n, m % n);
}
int main() {
  long long n, m;
  cin >> n >> m;
  vector<long long> a(n);
  for (int(i) = 0; (i) < (n); (i)++) cin >> a[i];
  map<long long, int> ma;
  ma[0]++;
  long long now = 0;
  for (int(i) = 0; (i) < (n); (i)++) {
    now = (now + a[i]) % m;
    ma[now]++;
  }
  long long cnt = 0;
  for (auto itr : ma) {
    cnt += nCr(itr.second, 2, 1000000007);
  }
  cout << cnt;
  return 0;
}
