백준 [ALGORITHM] - 블랙잭 (2798)

n, m = map(int, input().split())

maximum = 0
dack = list(map(int,input().split()))

for i in range(n-2):
    for j in range(i+1, n-1):
        for k in range(j+1, n):
            if (dack[i] + dack[j] + dack[k] <= m):
                maximum = max(maximum, dack[i] + dack[j] + dack[k])

print(maximum)