Greatest Number

Problem G Greatest Number 
 
Saya likes math, because she think math can make her cleverer. 
One day, Kudo invited a very simple game: 
Given N integers, then the players choose no more than four integers from them (can be 
repeated) and add them together. Finally, the one whose sum is the largest wins the game. It seems 
very simple, but there is one more condition: the sum shouldn’t larger than a number M. 
Saya is very interest in this game. She says that since the number of integers is finite, we can 
enumerate all the selecting and find the largest sum. Saya calls the largest sum Greatest Number 
(GN). After reflecting for a while, Saya declares that she found the GN and shows her answer. 
Kudo wants to know whether Saya’s answer is the best, so she comes to you for help. 
Can you help her to compute the GN? 
 
Input 
The input consists of several test cases. 
The first line of input in each test case contains two integers N (0<N≤1000) and M(0<M≤ 
1000000000), which represent the number of integers and the upper bound. 
Each of the next N lines contains the integers. (Not larger than 1000000000) 
The last case is followed by a line containing two zeros. 
 
Output 
For each case, print the case number (1, 2 …) and the GN. 
Your output format should imitate the sample output. Print a blank line after each test case. 
 
Sample Input Output for the Sample Input 
2 10 
100 
2 
 
0 0 

Case 1: 8

这个题用纯暴力的话肯定会超时，那么要想到二分查找的方法，因为他可能是1个2.3.4个，不一定所以你要先把第一个最大的存下来，然后把两个与一个的（符合条件的）传到一个数组里，然后互相相加选出最大的，就得到了2个3个与4个的最后与一个的比较就可以了；