output_description: Print the number of times the ball will make a bounce where the coordinate is
  at most X.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N X
      L_1 L_2 ... L_{N-1} L_N
attempt: numeroA, numeroB = [], []
  contadorCoord = 0
  contador = 1
  numerosSTRa = input().split(" ")
  for p in numerosSTRa:
      numeroA.append(int(p))
  
  
  numerosSRTB = input().split(" ")
  for j in numerosSRTB:
      numeroB.append(int(j))
  
  for i in numeroB:
      contadorCoord += i
      if contadorCoord <= numeroA[1]:
          contador += 1
  print(contador)
  
problem_description: Statement
  
  A ball will bounce along a number line, making N + 1 bounces. It will make the
  first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at
  coordinate D_i = D_{i-1} + L_{i-1}.
  
  How many times will the ball make a bounce where the coordinate is at most X?
samples: [{"input": "3 6\n    3 4 5", "output": "2\n    \n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two\nare less than or equal to 6.\n\n* * *"}, {"input": "4 9\n    3 3 3 3", "output": "4\n    \n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which\nfour are less than or equal to 9."}]