Problem:
Score : 500 points

Problem Statement

Given are a sequence of N positive integers A_1, A_2, \ldots, A_N, and a positive integer K.

Find the number of non-empty contiguous subsequences in A such that the remainder when dividing the sum of its elements by K is equal to the number of its elements. We consider two subsequences different if they are taken from different positions, even if they are equal sequences.

Constraints

All values in input are integers.

1 \leq N \leq 2\times 10^5

1 \leq K \leq 10^9

1 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N K
A_1 A_2 \cdots A_N

Output

Print the number of subsequences that satisfy the condition.

Sample Input 1

5 4
1 4 2 3 5

Sample Output 1

4

Four sequences satisfy the condition: (1), (4,2), (1,4,2), and (5).

Sample Input 2

8 4
4 2 4 2 4 2 4 2

Sample Output 2

7

(4,2) is counted four times, and (2,4) is counted three times.

Sample Input 3

10 7
14 15 92 65 35 89 79 32 38 46

Sample Output 3

8

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; ++i)
#define all(a) (a).begin(), (a).end()

int N, K;
vector<int> A;
int main() {
  cin >> N >> K;

  A.resize(N);
  vector<int> B(N);

  rep(i, N) {
    cin >> A[i];
    B[i] = (A[i] % K) - 1;
  }

  ll ans = 0;

  vector<int> S(N + 1, 0);
  rep(i, N) S[i + 1] = (S[i] + B[i]) % K;

  map<int, vector<int>> m;
  rep(i, N + 1) m[S[i]].push_back(i);

  rep(i, N + 1) {
    auto it = lower_bound(all(m[S[i]]), i);
    auto it2 = lower_bound(all(m[S[i]]), i + K);
    ans += distance(it, it2) - 1;
  }

  cout << ans << endl;
  return 0;
}