#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>

#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define RREP(i,m,n) for(int i=int(n)-1;i>=int(m);--i)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x)  cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR 
#endif
using namespace std;

using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;

//struct edge {int from, to, cost;};

constexpr double EPS = 1e-10;
//constexpr double PI  = acos(-1.0);
//constexpr int INF = INT_MAX;

template<class T> inline T sqr(T x) {return x*x;}

int c[1000000000] = {};

void solve() {
    int n,m;
    cin >> n >> m;
    VLL a(n);
    REP(i,0,n) cin >> a[i];
    REP(i,0,n) a[i] %= m;
    VI ru(n);
    ru[0] = a[0];
    REP(i,1,n) ru[i] += (ru[i-1] + a[i]) % m;
    //VI c(m);
    REP(i,0,n) ++c[ru[i]];
    //REP(i,0,m) dump(c[i]);
    LL sum = 0;
    LL ans = 0;
    REP(i,0,n) {
        ans += c[sum];
        sum = (sum + m + a[i]) % m;
        --c[ru[i]];
    }
    cout << ans << endl;
}

int main() {
    solve();
    
    return 0;
}