#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e5 + 5;
const int M = 1e3 + 5;
int n, c, a[N], memo[M][N];
int pref[N];
int solve(int i, int rem) {
    if(rem < 0)
        return 0;
    if(rem == 0)
        return 1;
    if(i == n + 1)
        return 0;
    int &ans = memo[rem][i];
    if(ans != -1)
        return ans;
    return ans = max(solve(i + 1, rem - a[i]), solve(i + 1, rem));
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> c;
    for(int i = 1;i <= n;i++)
        cin >> a[i];
    sort(a + 1, a + n + 1);
    for(int i = 1;i <= n;i++)
        pref[i] = pref[i - 1] + a[i];
    memset(memo, -1, sizeof memo);
    for(int i = 1;i <= c;i++) {
        int rem = c - i;
        int j = upper_bound(a + 1, a + n + 1, rem) - a;
        int sum = pref[j - 1];
        if(sum > i)
            continue;
        if(solve(j, i - sum))
            return cout << i, 0;
    }
    return 0;
}