#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, memo[N][M], a[N];
int solve(int i, int rem) {
	if(rem < 0)
		return 0;
	if(rem == 0)
		return 1;
	if(i == n)
		return 0;
	int &ans = memo[rem][i];
	if(~ans)
		return ans;
	return ans = max(solve(i + 1, rem - a[i]), solve(i + 1, rem));
}
vector<int> v;
void print(int i, int rem) {
	if(i == n)
		return;
	if(solve(i + 1, rem - a[i])) {
		v.push_back(i);
		print(i + 1, rem - a[i]);
	} else
		print(i + 1, rem);
}
bool check(int x) {
	if(!solve(0, x))
		return false;
	v.clear();
	print(0, x);
	int sz = v.size();
	for(int i = n - 1, j = sz - 1;i >= 0 && j >= 0;i--, j--) {
		if(a[i] == v[j])
			continue;
		if(a[i] + x <= c)
			return false;
	}
	return true;
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> c;
    for(int i = 0;i < n;i++)
		cin >> a[i];
	sort(a, a + n, greater<>());
	memset(memo, -1, sizeof memo);
	for(int i = 1;i <= c;i++) {
		if(check(i))
			return cout << i, 0;
	}
    return 0;
}