#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int consistency(int n, int t){
	
    sort(begin(a), end(a)); 
    
    int minDif = INF;
    int ans = -1;   
    
    for(int i=0; i<=n-3; i++){  
        int s = i+1;
        int e = n-1;    
        
        while(s<e){
            int sum = a[i] + a[s] + a[e];
            int dif = abs(t - sum); 
            
            if(dif < minDif){
                minDif = dif;
                ans = sum;
            }   
            
            if(sum >= t){
                e--;
            }
            else{
                s++;
            }
        }
    }   
    
    return ans;

}















int practice(int n){


    return 0;
}





void solve() {
    
    int n, t;
    cin>> n >> t;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n, t) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}