#include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-20
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll c[2000006],p1[2000005],p2[2000006],mod=1e9+7;
ll C(ll a,ll b){return (p1[a]%mod*p2[b]%mod*p2[a-b]%mod)%mod;}
ll qpow(ll a,ll b){ll res=1;while(b){if(b&1) res=res*a%mod;a=a*a%mod;b/=2;}return res%mod;}
int main(){
    ll n,m,k;cin>>n>>m>>k;p1[0]=1;
    if(n>m+k){cout<<0<<endl;return 0;}
    for(ll i=1;i<=2000000;i++){
        p1[i]=p1[i-1]*i%mod;
    }
    p2[2000000]=qpow(p1[2000000],mod-2);
    for(ll i=2000000-1;i>=0;i--){
        p2[i]=p2[i+1]*(i+1);p2[i]%=mod;
    }
    ll ans=C(n+m,n)-C(n+m,m+k+1);
    ans=(ans%mod+mod)%mod;
    cout<<ans<<endl;
}
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

ll dp[101][101];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	ll N, X;
	cin >> N >> X;
	int A[100];
	rep(i, N) cin >> A[i];

	ll kotae = 2e18;
	ll b = 0;
	rep1(s, N) {
		b += 2000000000;
		ll amari = X % s;
		dp[0][0] = b;
		rep(i, N) {
			ce(i);
			for (int j = min(i, s - 1); j >= 0; j--) {
				int t0 = A[i] % s;
				int t = t0;
				rep(k, s - t0) {
					if (dp[j][k] >= b) chmax(dp[j + 1][t], dp[j][k] + A[i]);
					t++;
				}
				t -= s;
				for (int k = s - t0; k < s; k++) {
					if (dp[j][k] >= b) chmax(dp[j + 1][t], dp[j][k] + A[i]);
					t++;
				}
			}
		}
		if (dp[s][amari] >= b) {
			chmin(kotae, (X - dp[s][amari] + b) / s);
		}
	}
	co(kotae);

	Would you please return 0;
}