number2(python3)

1难度增加的抽签问题

还是这个题，用二分查找

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


def binary_search(x):
    l = 0
    r = n - 1
    while l <= r:
        i = (l + r) // 2
        if k[i] == x:
            return True
        elif k[i] < x:
            l = i + 1
        else:
            r = i - 1


    return False



def solve(k,n):
    f = False

    for i in range(n):
        for j in range(n):
            for mmp in range(n):
                if (binary_search(m - k[i] - k[j] - k[mmp])):
                    f = True
    if f:
        print("Yes")
    else:
        print("No")

solve(k,n)