import java.util.Scanner;

public class Main {

    private void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] L = new int[N];
        for (int i = 0; i < N; i++) {
            L[i] = sc.nextInt();
        }

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

        int count = 1;
        for (int i = 1; i <= N; i++) {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        }
        System.out.print(count);
    }

    // Main
    public static void main(String[] args) {
        new Main().solve();
    }

} import java.util.Scanner; Scanner java.util public class Main {

    private void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] L = new int[N];
        for (int i = 0; i < N; i++) {
            L[i] = sc.nextInt();
        }

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

        int count = 1;
        for (int i = 1; i <= N; i++) {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        }
        System.out.print(count);
    }

    // Main
    public static void main(String[] args) {
        new Main().solve();
    }

} Main private void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] L = new int[N];
        for (int i = 0; i < N; i++) {
            L[i] = sc.nextInt();
        }

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

        int count = 1;
        for (int i = 1; i <= N; i++) {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        }
        System.out.print(count);
    } solve {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] L = new int[N];
        for (int i = 0; i < N; i++) {
            L[i] = sc.nextInt();
        }

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

        int count = 1;
        for (int i = 1; i <= N; i++) {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        }
        System.out.print(count);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int X = sc.nextInt(); X sc.nextInt() sc.nextInt sc int[] L = new int[N]; L new int[N] N for (int i = 0; i < N; i++) {
            L[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            L[i] = sc.nextInt();
        } {
            L[i] = sc.nextInt();
        } L[i] = sc.nextInt() L[i] L i sc.nextInt() sc.nextInt sc int[] D = new int[N + 1]; D new int[N + 1] N + 1 N 1 D[0] = 0 D[0] D 0 0 int count = 1; count 1 for (int i = 1; i <= N; i++) {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        } int i = 1; int i = 1; i 1 i <= N i N i++ i++ i {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        } {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        } D[i] = D[i - 1] + L[i - 1] D[i] D i D[i - 1] + L[i - 1] D[i - 1] D i - 1 i 1 L[i - 1] L i - 1 i 1 if (D[i] <= X) {
                count++;
            }
            else {
                break;
            } D[i] <= X D[i] D i X {
                count++;
            } count++ count {
                break;
            } break; System.out.print(count) System.out.print System.out System System.out count // Main
    public static void main(String[] args) {
        new Main().solve();
    } main {
        new Main().solve();
    } new Main().solve() new Main().solve new Main() String[] args args public class Main {

    private void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] L = new int[N];
        for (int i = 0; i < N; i++) {
            L[i] = sc.nextInt();
        }

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

        int count = 1;
        for (int i = 1; i <= N; i++) {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        }
        System.out.print(count);
    }

    // Main
    public static void main(String[] args) {
        new Main().solve();
    }

} public class Main {

    private void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] L = new int[N];
        for (int i = 0; i < N; i++) {
            L[i] = sc.nextInt();
        }

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

        int count = 1;
        for (int i = 1; i <= N; i++) {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        }
        System.out.print(count);
    }

    // Main
    public static void main(String[] args) {
        new Main().solve();
    }

} Main
import java.util.Scanner;

public class Main {

    private void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] L = new int[N];
        for (int i = 0; i < N; i++) {
            L[i] = sc.nextInt();
        }

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

        int count = 1;
        for (int i = 1; i <= N; i++) {
            D[i] = D[i - 1] + L[i - 1];
            if (D[i] <= X) {
                count++;
            }
            else {
                break;
            }
        }
        System.out.print(count);
    }

    // Main
    public static void main(String[] args) {
        new Main().solve();
    }

}
