#include <queue>

 #include <cstdio>

 #include <algorithm>

 #include <cstring>

 #define ll long long

 #define N 400010

 #define uint unsigned int

 #define inf 0x3f3f3f3f3f3f3fll

 using namespace std;

 int n,use[N];

 ll a[N],amin;

 ll dis[N],bmin,bmax;

 struct node{

     int id;ll d;

     friend bool operator<(const node &s1,const node &s2){

         return s1.d>s2.d;}

     node(int id,ll d):id(id),d(d){}

     node(){}

 };

 ll dijkstra()

 {

     priority_queue<node>q;

     memset(dis,0x3f,sizeof(dis));

     dis[]=;

     q.push(node(,));

     while(!q.empty()){

         node k=q.top();q.pop();int x=k.id;

         if(use[x]) continue;use[x]=;

         for(int i=;i<=n;i++){

             ll v=(x+a[i])%amin;

             if(dis[v]>dis[x]+a[i]){

                 dis[v]=dis[x]+a[i];

                 q.push(node(v,dis[v]));

             }

         }

     }

 }

 int main()

 {

     scanf("%d%lld%lld",&n,&bmin,&bmax);

     for(int i=;i<=n;i++)

         scanf("%lld",&a[i]);

     sort(a+,a+n+);

     amin=a[];

     dijkstra();

     ll ans=;

     for(int i=;i<amin;i++){

         if(dis[i]<inf&&bmax>=dis[i])

             ans+=(bmax-dis[i])/amin+-((bmin--dis[i]>)?((bmin--dis[i])/amin+):); //floor

     }

     printf("%lld\n",ans);

     return ;

 }