/// OrangeWarrior #1
#include<bits/stdc++.h>
using namespace std;
class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
}f("secv5.in");
ofstream g("secv5.out");
long long n,a,b;
bool ok=0,ok2=0;
unsigned int v[(1<<20)+3];
long long sol,nr;
unordered_map<unsigned int,int>st;
int nrda, nrdb;
unordered_map<unsigned int,int>dr;
int main()
{
    f>>n>>a>>b;
    for(int i=1;i<=n;++i)
        f>>nr,v[i]=nr;
    long long c1=0;
    long long c2=0;
    for(int i=1;i<=n;++i)
    {
        if(i>1){
            if(st[v[i-1]]==1)
                --nrda;
            if(dr[v[i-1]]==1)
                --nrdb;
            st[v[i-1]]--,dr[v[i-1]]--;
        }
        while(nrda<a && c1<n)
        {
            ++c1;
            if(st[v[c1]]==0)
                ++nrda;
            st[v[c1]]++;
        }
        while(nrdb<=b && c2<n)
        {
            if(nrdb==b && dr[v[c2+1]]==0)
                break;
            else
            {
                ++c2;
                if(dr[v[c2]]==0)
                    ++nrdb;
                dr[v[c2]]++;
            }
        }
        if(nrda==a)
            sol+=c2-c1+1;
    }
    g<<sol;
    return 0;
}