#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin>>n;
ll k;cin>>k;
ll b[n];
for(ll i=0;i<n;i++){
cin>>b[i];
}ll count = 0 ;
ll sum = 0 ;
unordered_map <ll,ll> g ;
for (int i = 0, j = 0; j < n; j++) {
g[b[j]]=g[b[j]]+1;
ll d = g.size();
while (d>k){
g[b[i]] = g[b[i]] - 1;
if(g[b[i]]==0){
g.erase(b[i]);
}
i++;
d = g.size();
}
count += (j - i + 1);
}
cout<<count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbGwgbG9uZyBsb25nCgppbnQgbWFpbigpIHsKCWxsIG47CiAgICBjaW4+Pm47CiAgICBsbCBrO2Npbj4+azsKICAgIGxsIGJbbl07CiAgICBmb3IobGwgaT0wO2k8bjtpKyspewogICAgICAgIGNpbj4+YltpXTsKICAgIH1sbCBjb3VudCA9IDAgOwogCiAKICAgIGxsIHN1bSA9IDAgOwogICAgdW5vcmRlcmVkX21hcCA8bGwsbGw+IGcgOyAKICAgIGZvciAoaW50IGkgPSAwLCBqID0gMDsgaiA8IG47IGorKykgewogICAgICAgICAgICBnW2Jbal1dPWdbYltqXV0rMTsKICAgICAgICAgICAgbGwgZCA9IGcuc2l6ZSgpOwogICAgICAgICAgICB3aGlsZSAoZD5rKXsKICAgICAgICAgICAgICAgIGdbYltpXV0gPSBnW2JbaV1dIC0gMTsKICAgICAgICAgICAgICAgIGlmKGdbYltpXV09PTApewogICAgICAgICAgICAgICAgICAgIGcuZXJhc2UoYltpXSk7CiAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgICAgICBpKys7CiAKICAgICAgICAgICAgICAgIGQgPSBnLnNpemUoKTsKIAogICAgICAgICAgICB9CiAgICAgICAgICAgIGNvdW50ICs9IChqIC0gaSArIDEpOwogICAgIH0KIAogICAgY291dDw8Y291bnQ7CiAgICByZXR1cm4gMDsKfQ==