20250830

Length, TARGET = map(int, input().split())

Treasure = list(map(int, input().split()))

stack = [(0, Length)]

Dl = [1, 0, 1]

Dr = [0, -1, -1]

visit = {}

cnt = 0

while stack:

Left, Right = stack.pop()

if Left <= Right:

if not (Left, Right) in visit:

visit[(Left, Right)] = True

if sum(Treasure[Left:Right]) == TARGET:

cnt += 1

for i in range(3):

stack.append((Left + Dl[i], Right + Dr[i]))

print(cnt)