n,x=map(int,input().split())
Y = list(map(int,input().split()))
Z = [0]*n
a = 0
for i in range(n):
  a +=Y[i]
  Z[i]=a
import bisect
print(1+bisect.bisect_left(Z,x+1)) n,x=map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split x Y = list(map(int,input().split())) Y list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split Z = [0]*n Z [0]*n [0] 0 n a = 0 a 0 for i in range(n):
  a +=Y[i]
  Z[i]=a i range(n) range n a +=Y[i] a Y[i] Y i Z[i]=a Z[i] Z i a import bisect bisect print(1+bisect.bisect_left(Z,x+1)) print 1+bisect.bisect_left(Z,x+1) 1 bisect.bisect_left(Z,x+1) bisect.bisect_left bisect bisect_left Z x+1 x 1 Y = list(map(int,input().split())) list(map(int,input().split())) Y n,x=map(int,input().split()) map(int,input().split()) n a +=Y[i] Y[i] a x=map(int,input().split()) map(int,input().split()) x a = 0 0 a Z = [0]*n [0]*n Z
n,x=map(int,input().split())
Y = list(map(int,input().split()))
Z = [0]*n
a = 0
for i in range(n):
  a +=Y[i]
  Z[i]=a
import bisect
print(1+bisect.bisect_left(Z,x+1))