import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int X = sc.nextInt();
    int[] L = new int[N+1];
    int distance = 0, ans = 0;
    for (int i=1; i<=N; i++) {
      L[i] = sc.nextInt();
    }
    for (int i=1; i<=N; i++) {
      if (distance + L[i] > X) {
        ans = i;
        break;
      }
      if ( i == N) {
        ans = i+1;
      }
      distance += L[i];
    }
     System.out.println(ans);
  }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz