#include<bits/stdc++.h>
#include<algorithm> 
using namespace std;
struct beibao{
	int jiazhi;
};
beibao ans[100010];
bool cmp(beibao a,beibao b){
	return a.jiazhi<b.jiazhi;
}
int main(){
	long long a,b;
	cin>>a>>b;
	for(int i=1;i<=a;i++){
		cin>>ans[i].jiazhi;
	}
	stable_sort(ans+1,ans+a+1,cmp);
	long long cnt=0;
	int sum[100000];
	for(int i=1;i<=a;i++){
		for(int j=a;j>=1;j--){
			if(ans[i].jiazhi+ans[i+1].jiazhi-ans[j].jiazhi<=b){
				sum[cnt]+=ans[i].jiazhi+ans[i+1].jiazhi+ans[j].jiazhi;
				cnt++;
			}else if(ans[i].jiazhi+ans[i+1].jiazhi-ans[j].jiazhi>b){
				break;
			}
		}
	} 
	stable_sort(sum+1,sum+cnt+1);
	cout<<sum[cnt];
}