#line 1 "a.cpp"
#include<iostream>
using namespace std;
#line 3 "/home/kotatsugame/library/math/modint.cpp"
#include<utility>
template<int m>
struct modint{
	unsigned int x;
	constexpr modint()noexcept:x(){}
	template<typename T>
	constexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}
	constexpr unsigned int val()const noexcept{return x;}
	constexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}
	constexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}
	constexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}
	constexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}
	constexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}
	constexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}
	constexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}
	constexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}
	constexpr modint operator+()const noexcept{return*this;}
	constexpr modint operator-()const noexcept{return modint()-*this;}
	constexpr modint pow(long long n)const noexcept
	{
		if(n<0)return pow(-n).inv();
		modint x=*this,r=1;
		for(;n;x*=x,n>>=1)if(n&1)r*=x;
		return r;
	}
	constexpr modint inv()const noexcept
	{
		int s=x,t=m,x=1,u=0;
		while(t)
		{
			int k=s/t;
			s-=k*t;
			swap(s,t);
			x-=k*u;
			swap(x,u);
		}
		return modint(x);
	}
	friend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}
	friend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}
	friend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}
	friend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}
	friend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}
	friend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}
	friend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}
	friend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}
};
#line 4 "a.cpp"
using mint=modint<(int)1e9+7>;
int N,A,B,L;
int S[40];
mint dp[41][20202];
mint tmp[41][20202];
const int LIM=20202;
mint fac[LIM+1],inv[LIM+1];
mint C(int a,int b){return fac[a]*inv[b]*inv[a-b];}
main()
{
	fac[0]=1;
	for(int i=1;i<=LIM;i++)fac[i]=fac[i-1]*i;
	inv[LIM]=1/fac[LIM];
	for(int i=LIM;i--;)inv[i]=inv[i+1]*(i+1);
	cin>>N>>A>>B>>L;
	for(int i=0;i<N;i++)cin>>S[i];
	dp[0][0]=1;
	for(int i=0;i<N;i++)
	{
		for(int j=0;j<=i+1;j++)for(int k=0;k<=B;k++)tmp[j][k]=0;
		for(int j=0;j<=i;j++)for(int k=0;k<=B;k++)
		{
			tmp[j+1][k+1]+=dp[j][k];
			int R=k+S[i]+1;
			if(R>B)R=B+1;
			tmp[j+1][R]-=dp[j][k];
		}
		for(int j=0;j<=i+1;j++)
		{
			for(int k=0;k<=B;k++)
			{
				tmp[j][k+1]+=tmp[j][k];
				dp[j][k]+=tmp[j][k];
			}
		}
	}
	mint ans=0;
	for(int j=0;j<=N;j++)for(int k=0;k<=B;k++)
	{
		int uA=j*L-k;
		if(uA>A)continue;
		int rA=A-uA;
		ans+=dp[j][k]*C(rA+N-1,N-1);
	}
	cout<<ans<<endl;
}