[백준] 블랙잭 2798 브루트포스(Brute Force) Python

import itertools
 
N, M = map(int, input().strip().split())
lists = list(map(int, input().strip().split()))
 
chk = 0
 
lists_combinations = itertools.combinations(lists,3)
combisums = []
 
for i in lists_combinations:
    if M == sum(list(i)):       # 만약 같은 값이 나오면 최대이기에 출력하고 종료
        print(sum(list(i)))
        chk = 1
        break
 
    if sum(list(i)) <= M:
        combisums.append(sum(list(i)))
 
if chk == 0:
    print(max(combisums))