def main():
    N, P = map(int, input().split())
    nums = list(map(int, input().split()))

    lst = []

    for i in range(N):
        lst.append((nums[i], i))
    lst.sort(reverse=True)

    min_length = N
    for peak, idx in lst:
        suma = peak
        left_idx = idx - 1
        right_idx = idx + 1
        length = 1
        while suma < P and length < min_length:
            if left_idx < 0:
                suma += nums[right_idx]
                right_idx += 1
            elif right_idx > N - 1:
                suma += nums[left_idx]
                left_idx -= 1

            else:
                if nums[left_idx] > nums[right_idx]:
                    suma += nums[left_idx]
                    left_idx -= 1
                else:
                    suma += nums[right_idx]
                    right_idx += 1
            length += 1
        if length < min_length:
            min_length = length
    print(min_length)


main()