#include <fstream>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <cstdint>
#include <deque>
using namespace std;

ifstream cin("D:/C++ Vault/test.in");
ofstream cout("D:/C++ Vault/test.out");

int v[10000];
int n,l,u;

int check(int x) {

    int fp = 0,sp = 0,c = 0,ans = 0;

    unordered_map<int,int> vf;

    while (sp < n) {

        vf[sp] ++;

        if (vf[sp] == 1) c++;

        while (c > x) {

            vf[fp] --;

            if (vf[fp] == 0) c--;

            fp++;

        }

        ans += sp - fp;

        sp++;

    }

    return ans;


}

int32_t main() {

    cin>>n>>l>>u;

    for (int i=0; i<n; i++) {
        cin>>v[i];
    }

    cout<<check(u) - check(l-1) + 1;

}