#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define all(x) (x).begin(), (x).end()
#define nall(x) next((x).begin()), (x).end()
constexpr int mod = 1e9 + 7;
constexpr int M = 500;

void slove()
{
    int n, W, x;
    cin >> n >> W;
    unordered_map<int, int> cot;
    for(int i = 1;i <= n;++i)
        cin >> x, ++cot[x];

    // vector<int> f(W + 1);
    bitset<200005> f;
    f[0] = 1; 
    int cnt = 0;
    for(auto& e : cot)
    {
        ++cnt;
        if(cnt >= M)
            break;
        int tot = e.second;
        for(int i = 1;i <= tot; tot -= (i),i <<= 1)
        {
            for(int j = W;j >= i * e.first;--j)
                f[j] = max(f[j], f[j - i * e.first]);
        }
        for (int i = W; i >= tot * e.first; --i)
            f[i] = max(f[i], f[i - tot * e.first]);
    }
    int ans = -1;
    for(int i = 0;i <= W;++i)
        if(f[i])
            ans = max(ans, i);
    cout << ans << endl;
}
signed main()
{
    cin.tie(0)->sync_with_stdio(false);
    int t = 1;
    while(t--)
        slove();
    return 0;
}