#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************





//? Good Subarrays Hashing

//* We need to find subarrays : (P[R] - P[L-1])%k == 0
//*                             P[R]%k == P[L-1]%k
//*     Hence for P[R]%k find P[R]%k in past


//* Eg     :    [4,  5,  0, -2, -3,  1]   , k = 5
//* sum    :  0  4   9   9   7   4   5     
//* sum%m  :  0  4   4   4   2   4   0     
//* ct     :  1  1   2   3   1   4   2
//* ans    :         1 + 2 + 0 + 3 + 1


vector<int> a;
int consistency(int n, int k) {
	
	unordered_map<int,int> mp = {{0, 1}};
	int sum = 0;
	int ans = 0;
	for(int i=0; i<n; i++){
	    sum += a[i];
	    int rem = ((sum%k)+k)%k;
	    if(mp.count(rem)){
	        ans += mp[rem];
	    }
	    mp[rem]++;
	}
	
	return ans;

}

















int practice(int n, int k){


    return 0;
}




void solve() {
    
	int n, k;
	cin >> n >> k;
	
	a.resize(n);
	for(int i=0; i<n; i++) cin >> a[i];
	
    cout << consistency(n, k) << endl;

}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}