#include <bits/stdc++.h>
using namespace std;
int main() {
int n1,k;
cin>>n1>>k;
int A[n1];
for(int i = 0 ; i<n1 ; i++){
cin>>A[i];
}
unordered_map<int,int>m;
int i = 0 , j = 0;
int cnt = 0;
while(j<n1){
m[A[j]]++;
int d = m.size();
while(d>k){
m[A[i]] = m[A[i]] - 1;
if(m[A[i]]==0){
m.erase(A[i]);
}
i++;
d = m.size();
}
cnt += (j-i+1);
j++;
}
cout<<cnt<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CglpbnQgbjEsazsKCWNpbj4+bjE+Pms7CglpbnQgQVtuMV07Cglmb3IoaW50IGkgPSAwIDsgaTxuMSA7IGkrKyl7CgkJY2luPj5BW2ldOwoJfQoJdW5vcmRlcmVkX21hcDxpbnQsaW50Pm07CglpbnQgaSA9IDAgLCBqID0gMDsKCWludCBjbnQgPSAwOwoJd2hpbGUoajxuMSl7CgkJbVtBW2pdXSsrOwoJCWludCBkID0gbS5zaXplKCk7CgkJd2hpbGUoZD5rKXsKCQkgICAJbVtBW2ldXSA9IG1bQVtpXV0gLSAxOwoJCSAgIAlpZihtW0FbaV1dPT0wKXsKCQkgICAJCW0uZXJhc2UoQVtpXSk7CgkJICAgCX0KCQkgICAJaSsrOwoJCSAgIAlkID0gbS5zaXplKCk7CgkJfQoJCWNudCArPSAoai1pKzEpOwoJCWorKzsKCX0KCWNvdXQ8PGNudDw8ZW5kbDsKCXJldHVybiAwOwp9