#include <bits/stdc++.h>
static const long long INF = 1000000000000000000LL;
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() {
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  for (long long i = 0; i < (n); i++) cin >> a[i];
  vector<int> rui(n + 1);
  rui[0] = 0;
  for (int i = 0; i < n; ++i) {
    rui[i + 1] = rui[i] + a[i];
  }
  long long res = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = i; j < n; ++j) {
      long long tmp = rui[j + 1] - rui[i];
      if (tmp % m == 0) {
        ++res;
      }
    }
  }
  cout << res << endl;
  return 0;
}
