// May this submission get accepted!

#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
template<class T> bool chmax(T &a, const T &b) { if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) do { cerr << "[DEBUG] " #q ": ["; REP(DUMPALL_ITR, (q).size()) { cerr << (q)[DUMPALL_ITR] << (DUMPALL_ITR == DUMPALL_ITR_len-1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; } while (false)
template<class T> T gcd(T a, T b) { if (a < b) std::swap(a, b); while (b) std::swap(a %= b, b); return a; }
template<class T> T lcm(const T a, const T b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
using  ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using  ld = long double;
using namespace std;

// モジュール

// ランレングス圧縮 O(N)
template <class RandomAccessIterator>
vector<ll> run_length(RandomAccessIterator first, RandomAccessIterator last) {
    vector<ll> rl;
    for (RandomAccessIterator itr = first; itr != last; ) {
        RandomAccessIterator jtr = itr++;
        while ((itr != last && *itr == *(itr-1))) itr++;
        rl.push_back(itr - jtr);
    }
    return rl;
}

// 処理内容
int main() {
    
    // インタラクティブ問題では除去した方がいいかも
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll n, k; cin >> n >> k;
    vector<ll> a(n);
    REP(i, n) cin >> a[i];

    REP(i, n) {
        (a[i] += k - 1) %= k;
    }

    vector<ll> as(n+1, 0);
    vector<ll> ax(n+1, 0);
    REP(i, n) as[i+1] = (as[i] + a[i]) % k;
    REP(i, n+1) ax[i] = i;
    using aatyp = pair<ll, ll>;
    vector<pair<ll, ll>> aa(n+1);
    REP(i, n+1) aa[i] = aatyp(as[i], ax[i]);

    // REP(i, n+1) {
    //     cerr << aa[i].first << " " << aa[i].second << ", ";
    // }
    // cerr << endl;

    sort(ALL_OF(aa));

    // REP(i, n+1) {
    //     cerr << aa[i].first << " " << aa[i].second << ", ";
    // }
    // cerr << endl;

    ll ans = 0;
    for (ll ub = 0; ub < n; ) {

        ll u = aa[ub].first;
        ll ue = lower_bound(ALL_OF(aa), aatyp(u+1, 0)) - aa.begin();
        
        RANGE(i, ub, ue-1) {
            ll j = aa[i].second;
            auto itrb = lower_bound(ALL_OF(aa), aatyp(u, j+1));
            auto itre = lower_bound(ALL_OF(aa), aatyp(u, j+k));
            ans += itre - itrb;
            // for (auto itr = itrb; itr < itre; itr++) {
            //     cerr << "[" << j << ", " << itr->second << ")" << endl;
            // }
        }

        ub = ue;

    }

    cout << ans << endl;
    
}

Measured memory_bytes: 8064