#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;

int main() {
    int N, K;
    cin >> N >> K;

    unordered_map<int, vector<long long>> remainder_to_sums; // 余数→前缀和列表
    remainder_to_sums[0].push_back(0); // 初始化前缀和0

    long long pre_sum = 0;
    long long result = 0;

    for (int i = 0; i < N; i++) {
        int num;
        cin >> num;
        pre_sum += num;

        int remainder = (pre_sum % K + K) % K;

        // 遍历相同余数的前缀和，判断当前前缀和 - 历史前缀和 ≥ 0
        for (long long history_sum : remainder_to_sums[remainder]) {
            if (pre_sum - history_sum >= 0) {
                result++;
            }
        }

        // 加入当前前缀和到余数列表
        remainder_to_sums[remainder].push_back(pre_sum);
    }

    cout << result << endl;
    return 0;
}