#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long

template <typename T> void print_vv(vector<vector<T>> &vv){
  for(int i=0;i<vv.size();i++){
    cout << i << " * ";
    for(auto j:vv[i]) cout << j << ' ';
    cout << endl;
  }
}
template <typename T> void print_s(set<T> &a){
  cout << "{ ";
  for(auto i:a) cout << i << ' ';
  cout << '}' << endl;
}

int main(){

  int n,t;
  cin >> n >> t;
  vector<int> a(n);
  for(auto& i : a) cin >> i;
  sort(a.rbegin(), a.rend());

  if(n<=20){
    ll ans = 0;
    for(int i=0; i<(1<<n); ++i) {
      ll count =0;
      for(int j=0; j<n; ++j) {
	count += (ll)(i>>j&1)*a[j];
      }
      if(count <=t) ans = max(ans,count);
    }
    cout << ans << endl;
    return 0;
  }

  set<ll> ans1,ans2;
  for(int i=0; i<(1<<20); ++i) {
    ll count =0;
    for(int j=0; j<20; ++j) {
      count += (ll)(i>>j&1)*a[j];
    }
    if(count <=t) ans1.insert(count);
  }
  //print_s(ans1);
  
  n-=20;
  for(int i=0; i<(1<<n); ++i) {
    ll count =0;
    for(int j=0; j<n; ++j) {
      count += (ll)(i>>j&1)*a[j+20];
    }
    if(count <=t) ans2.insert(count);
  }
  //print_s(ans2);
  
  vector<ll> a1(ans1.begin(), ans1.end());

  ll total = 0;
  for(auto& i : ans2) {
    auto it = lower_bound(a1.begin(), a1.end(), t-i+1);
    if(it == a1.begin()) continue;
    total = max(total, (ll)i+*(it-1));
  }

  cout << total << endl;
  

}

//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(i,n) for (ll i = ll(n)-1; i >= 0; i--)
#define rrep2(i,n,t) for (ll i = ll(n)-1; i >= (ll)t; i--)
#define rrep3(i,n,t,d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)
#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define popcount(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using LP = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vvvb = vector<vvb>;
using vp = vector<P>;
using vvp = vector<vector<P>>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
template<class T> void vecout(const vector<T> &v,char div='\n') { rep(i,v.size()) cout<<v[i]<<(i==int(v.size()-1)?'\n':div);}
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;}
void scan(){}
template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }
template<class T> void print(const T& t){ cout << t << '\n'; }
template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }
template<class... T> void fin(const T&... a) { print(a...); exit(0); }
struct Init_io {
    Init_io() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        cout << boolalpha << fixed << setprecision(15);
    }
} init_io;
const string yes[] = {"no","yes"};
const string Yes[] = {"No","Yes"};
const string YES[] = {"NO","YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

int main() {
    INT(n);
    vvi v(n, vi(5));
    cin >> v;
    int ok = 0, ng = inf;
    auto f = [&](int x) -> bool {
        vvvb dp(n + 1, vvb(4, vb(1 << 5)));
        dp[0][0][0] = true;
        rep(i, n) rep(j, 4) rep(k, 1 << 5) {
                    if (!dp[i][j][k]) continue;
                    dp[i + 1][j][k] = true;
                    int nk = k;
                    rep(l, 5) if (v[i][l] >= x) nk |= 1 << l;
                    if (j < 3) dp[i + 1][j + 1][nk] = true;
                }
        return dp[n][3][(1 << 5) - 1];
    };
    while (abs(ok - ng) > 1) {
        int mid = (ng + ok) / 2;
        if (f(mid)) ok = mid;
        else ng = mid;
    }
    fin(ok);
}
