#include <fstream>
#include <vector>

using namespace std;

ifstream f("secv5.in");
ofstream g("secv5.out");

int n, l, r, sz;

const int MOD = 666013;

unsigned int a[2000005];

vector<pair<unsigned int, int>> hashMap[MOD];

inline void insertHash(unsigned int k)
{
    int key = k % MOD;

    for (auto it : hashMap[key]) {
        if (it.first == k) {
            it.second++;
            sz++;
            return;
        }
    }

    sz++;
    hashMap[key].push_back({k, 1});
}

inline void eraseHash(unsigned int k)
{
    int key = k % MOD;

    for (int i = 0; i < (int)hashMap[key].size(); ++i) {
        if (hashMap[key][i].first == k && hashMap[key][i].second == 1) {
            hashMap[key].erase(hashMap[key].begin() + i);
            sz--;
            return;
        } else if (hashMap[key][i].first == k && hashMap[key][i].second > 1) {
            hashMap[key][i].second--;
            sz--;
            return;
        }
    }
}

inline bool searchHash(unsigned int k)
{
    int key = k % MOD;

    for (auto it : hashMap[key]) {
        if (it.first == k && it.second == 1) {
            return 1;
        }
    }

    return 0;
}

inline long long twoPointers(int i)
{
    int st = 1;

    sz = 0;

    long long ans = 0;

    for (int dr = 1; dr <= n; ++dr) {
        insertHash(a[dr]);

        if (sz <= i) {
            ans += dr - st + 1;
        }
        else {
            while (st <= dr && sz > i) {
                eraseHash(a[st]);
                st++;
            }

            ans += dr - st + 1;
        }
    }

    for (int i = 1; i <= MOD; ++i) {
        if (!hashMap[i].empty()) {
            hashMap[i].clear();
        }

    }

    return ans;
}

int main()
{
    f >> n >> l >> r;

    for (int i = 1; i <= n; ++i) {
        f >> a[i];
    }

    g << twoPointers(r) - twoPointers(l - 1);

    return 0;
}