贪心,尽可能推迟点蜡烛的时间
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (300+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
int m,l,r,w[MAXN];
int q[MAXN]={0};
int main()
{
// freopen("Ghosts.in","r",stdin);
// freopen(".out","w",stdout);
cin>>m>>l>>r;
For(i,m) scanf("%d",&w[i]);
if (l<r)
{
cout<<"-1"<<endl;
return 0;
}
int L=1,R=0;
For(i,m)
{
int t=w[i];
while (L<=R&&q[L]<t-l) L++;
int size=R-L+1;
if (size<r)
{
int p=r-size;
Fork(j,t-p,t-1) q[++R]=j;
}
}
cout<<R<<endl;
return 0;
}