
import java.util.Scanner;

public class Main {
	public static void main(String arg[]) {

		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int X = sc.nextInt();

		int L[] = new int[N];
		int D[] = new int[N + 1];

		int count = 0;

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

		for (int i = 0; i <= N; i++) {
			if (i == 0) {
				D[0] = 0;
				continue;
			}

			D[i] = D[i - 1] + L[i - 1];

		}

		for (int i = 0; i <= N; i++) {
			if (D[i] <= X) {
				count++;
			}
		}

		System.out.print(count);

	}
}

/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