The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Codeforces Round 120 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

two pointers

*1900

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Non-Secret Cypher

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputBerland starts to seize the initiative on the war with Flatland. To drive the enemy from their native land, the berlanders need to know exactly how many more flatland soldiers are left in the enemy's reserve. Fortunately, the scouts captured an enemy in the morning, who had a secret encrypted message with the information the berlanders needed so much.

The captured enemy had an array of positive integers. Berland intelligence have long been aware of the flatland code: to convey the message, which contained a number *m*, the enemies use an array of integers *a*. The number of its subarrays, in which there are at least *k* equal numbers, equals *m*. The number *k* has long been known in the Berland army so General Touristov has once again asked Corporal Vasya to perform a simple task: to decipher the flatlanders' message.

Help Vasya, given an array of integers *a* and number *k*, find the number of subarrays of the array of numbers *a*, which has at least *k* equal numbers.

Subarray *a*[*i*... *j*] (1 ≤ *i* ≤ *j* ≤ *n*) of array *a* = (*a*_{1}, *a*_{2}, ..., *a*_{n}) is an array, made from its consecutive elements, starting from the *i*-th one and ending with the *j*-th one: *a*[*i*... *j*] = (*a*_{i}, *a*_{i + 1}, ..., *a*_{j}).

Input

The first line contains two space-separated integers *n*, *k* (1 ≤ *k* ≤ *n* ≤ 4·10^{5}), showing how many numbers an array has and how many equal numbers the subarrays are required to have, correspondingly.

The second line contains *n* space-separated integers *a*_{i} (1 ≤ *a*_{i} ≤ 10^{9}) — elements of the array.

Output

Print the single number — the number of such subarrays of array *a*, that they have at least *k* equal integers.

Please do not use the %lld specifier to read or write 64-bit integers in С++. In is preferred to use the cin, cout streams or the %I64d specifier.

Examples

Input

4 2

1 2 1 2

Output

3

Input

5 3

1 2 1 1 3

Output

2

Input

3 1

1 1 1

Output

6

Note

In the first sample are three subarrays, containing at least two equal numbers: (1,2,1), (2,1,2) and (1,2,1,2).

In the second sample are two subarrays, containing three equal numbers: (1,2,1,1,3) and (1,2,1,1).

In the third sample any subarray contains at least one 1 number. Overall they are 6: (1), (1), (1), (1,1), (1,1) and (1,1,1).

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/24/2023 06:50:18 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|