import java.util.Scanner;
 
public class Main{
  public static void main(String[] args){
	Scanner in=new Scanner(System.in);
    int N=in.nextInt();
    int X=in.nextInt();
    int D[]=new int[N+1];
    int L[]=new int[N];
    for(int i=0;i<N;i++){
    	L[i]=in.nextInt();
    }
    int count=1;
    for(int i=1;i<N+1;i++){
    	D[i]=D[i-1]+L[i-1];
      	if(D[i]<=X)
          count++;
      	else
          break;
    }
    System.out.println(count);
    in.close();
  }
}
/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