output_description: Print the smallest sub-array size in a line.
input_description: The input is given in the following format.
  
  $N$ $S$  
  $a_1$ $a_2$ ... $a_N$
attempt: n, s = list(map(int, input().split()))
  a = list(map(int, input().split()))
  
  ans = None
  for window in range(1, n + 1):
      sum_a = None
      for i in range(n - window):
          if sum_a == None:
              sum_a = sum(a[i:window])
          else:
              sum_a += a[i + window - 1] - a[i - 1]
          if sum_a >= s:
              ans = window
              break
      if ans != None:
          break
  
  if ans == None:
      ans = 0
  print(ans)
  
problem_description: The Smallest Window I
  
  For a given array $a_1, a_2, a_3, ... , a_N$ of $N$ elements and an integer
  $S$, find the smallest sub-array size (smallest window length) where the sum
  of the sub-array is greater than or equal to $S$. If there is not such sub-
  array, report 0.
samples: [{"input": "6 4\n    1 2 1 2 3 2", "output": "2"}, {"input": "6 6\n    1 2 1 2 3 2", "output": "3"}, {"input": "3 7\n    1 2 3", "output": "0"}]