#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n,c;
  cin>>n>>c;
  vector<int> weights(n);
  for(int i = 0;i<n;i++)
  {
    cin>>weights[i];
  }
  vector<int> dp(c+1,0);
  for(int i = 0;i<n;++i)
  for(int j = c;j>=weights[i];--j)
  {
    dp[j] = max(dp[j],dp[j-weights[i]] + weights[i]);
  }
  cout << dp[c] << endl;
  return 0;
}

超容量了