#include<bits/stdc++.h>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
using namespace std;
constexpr int M=1e6+5;
vector<int>pos[M];
int n,k,a[M],mp[M];long long ans;
struct segtree{int mn,cnt,lazy;}tr[M<<2];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
void addtag(int x,int c){tr[x].mn+=c;tr[x].lazy+=c;}
void pushdown(int x){if (tr[x].lazy) addtag(ls(x),tr[x].lazy),addtag(rs(x),tr[x].lazy),tr[x].lazy=0;}
void pushup(int x){tr[x].mn=min(tr[ls(x)].mn,tr[rs(x)].mn);tr[x].cnt=(tr[x].mn==tr[ls(x)].mn?tr[ls(x)].cnt:0)+(tr[x].mn==tr[rs(x)].mn?tr[rs(x)].cnt:0);}
void build(int l,int r,int x){
    tr[x].cnt=r-l+1; if (l==r) return; int mid=l+r>>1;
    build(l,mid,ls(x));build(mid+1,r,rs(x));
}
void update(int L,int R,int c,int l=0,int r=n,int x=1){
    if (L<=l&&r<=R) return addtag(x,c);
    int mid=l+r>>1;pushdown(x);
    if (L<=mid) update(L,R,c,l,mid,ls(x));
    if (R>mid) update(L,R,c,mid+1,r,rs(x));
    pushup(x);
}
int main(){
    n=read();k=read(); build(0,n,1);
    for (int i=1;i<=n;i++) a[i]=read();
    for (int i=1;i<=n;i++)
        if (!mp[a[i]]) mp[a[i]]=1,
            pos[a[i]].emplace_back(0);
    for (int i=1;i<=n;i++){
        const int x=a[i];
        if (pos[x].size()>k)
            update(pos[x][k-1]+1,pos[x][k],-1);
        pos[x].emplace_back(i);
        if (pos[x].size()>k)
            update(pos[x][k-1]+1,pos[x][k],1);
        ans+=tr[1].cnt-(n-i+1);
    }
    printf("%lld\n",ans);
    return 0;
}