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];
        L[0] = 0;
        for(int i = 1; i < N+1; i++) {
            L[i] = sc.nextInt();
        }
        sc.close();

        System.out.println(Bounding(N+1, X, L, 0, 0));
    }
    public static int Bounding(int N, int X, int[] L, int index, int sum) {
        if (N <= index) {
            return 0;
        }
        if (sum + L[index] <= X) {
            return 1 + Bounding(N, X, L, index + 1, sum + L[index]);
        }
        return 0;
    }
}

/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