import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int X = sc.nextInt();
		int[] D = new int[N+1];
		D[0] = 0;

		for (int i = 0; i < N; ++i) {
			D[i+1] = D[i] + sc.nextInt();
		}

		// X内でバウンドした回数
		int counter = 0;

		for(int coordinate : D) {
			if(X < coordinate) break;
			counter++;
		}

		System.out.println(counter);

		sc.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