#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
const int maxn=2e5+5;
const int mod=1e9+7;
ll dp[105][105][105];
ll a[maxn];
int main(){
    int n;
    scanf("%d",&n);
    ll x;
    scanf("%lld",&x);
    for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
    ll ans=3e18;
    for(int r=1;r<=n;r++){
        memset(dp[0],-1,sizeof dp[0]);
        dp[0][0][0]=0;

        for(int i=1;i<=n;i++){
            for(int j=0;j<=r;j++)
            for(int k=0;k<r;k++){
                dp[i][j][k]=dp[i-1][j][k];
                if(j>0&&dp[i-1][j-1][(k-(a[i]%r)+r)%r]!=-1)
                    dp[i][j][k]=max(dp[i][j][k],dp[i-1][j-1][(k-(a[i]%r)+r)%r]+a[i]);

              //  printf("%d %d %d ",i,j,k);
              //  printf("%lld\n",dp[i][j][k]);
            }
        }

        if(dp[n][r][x%r]>=0){
           // cout<<"r="<<r<<' '<<"rr="<<x%r<<' ';
          //  cout<<dp[n][r][x%r]<<endl;
          //  printf("dp[%d][%d]=%lld\n",r,x%r,dp[n][r][x%r]);
            ans=min(ans,(x-dp[n][r][x%r])/r);
        }

    }
    cout<<ans<<endl;

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
vi u,k;
vi dijkstra(int from,vvp g){
    vi dis(g.size(),inf);
    dis[from]=0;
    SPQ(P) pq;
    pq.push(P(0,from));
    while(!pq.empty()){
        auto t=pq.top();pq.pop();
        if(t.fi!=dis[t.se])continue;
        for(auto x:g[t.se]){
            ll cost=t.fi;
            if(t.fi%u[x.se])cost+=u[x.se]-t.fi%u[x.se];
            cost+=k[x.se];
            if(chmin(dis[x.fi],cost))pq.push(P(dis[x.fi],x.fi));
        }
    }
    return dis;
}
int main(){
    ll n,x;cin>>n>>x;
    vi v(n);rep(i,n)cin>>v[i];
    ll ans=inf;
    REP(s,1,n+1){
        vvi dp(s,vi(n+1,-inf));dp[0][0]=0;
        rep(i,n){
            vvi ndp=dp;
            rep(j,s)rep(k,n)if(dp[j][k]!=-inf){
                ll nj=(j+v[i])%s;
                chmax(ndp[nj][k+1],dp[j][k]+v[i]);
            }
            dp=ndp;
        }
        ll k=dp[x%s][s];
        if(k!=-inf)chmin(ans,(x-k)/s);
    }
    out(ans);
}