import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Eric
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BBounding solver = new BBounding();
        solver.solve(1, in, out);
        out.close();
    }

    static class BBounding {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int x = in.nextInt();
            int d = 0;
            int best = 1;
            for (int i = 0; i < n; i++) {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            }
            out.println(best);
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BBounding solver = new BBounding();
        solver.solve(1, in, out);
        out.close();
    }

    static class BBounding {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int x = in.nextInt();
            int d = 0;
            int best = 1;
            for (int i = 0; i < n; i++) {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            }
            out.println(best);
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BBounding solver = new BBounding();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BBounding solver = new BBounding();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) BBounding solver = new BBounding(); solver new BBounding() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class BBounding {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int x = in.nextInt();
            int d = 0;
            int best = 1;
            for (int i = 0; i < n; i++) {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            }
            out.println(best);
        }

    } BBounding public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int x = in.nextInt();
            int d = 0;
            int best = 1;
            for (int i = 0; i < n; i++) {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            }
            out.println(best);
        } solve {
            int n = in.nextInt();
            int x = in.nextInt();
            int d = 0;
            int best = 1;
            for (int i = 0; i < n; i++) {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            }
            out.println(best);
        } int n = in.nextInt(); n in.nextInt() in.nextInt in int x = in.nextInt(); x in.nextInt() in.nextInt in int d = 0; d 0 int best = 1; best 1 for (int i = 0; i < n; i++) {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            } {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            } d += in.nextInt() d in.nextInt() in.nextInt in if (d > x) {
                    best = i + 1;
                    break;
                } d > x d x {
                    best = i + 1;
                    break;
                } best = i + 1 best i + 1 i 1 break; if (i == n - 1)
                    best = n + 1; i == n - 1 i n - 1 n 1 best = n + 1 best n + 1 n 1 out.println(best) out.println out best int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BBounding solver = new BBounding();
        solver.solve(1, in, out);
        out.close();
    }

    static class BBounding {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int x = in.nextInt();
            int d = 0;
            int best = 1;
            for (int i = 0; i < n; i++) {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            }
            out.println(best);
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BBounding solver = new BBounding();
        solver.solve(1, in, out);
        out.close();
    }

    static class BBounding {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int x = in.nextInt();
            int d = 0;
            int best = 1;
            for (int i = 0; i < n; i++) {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            }
            out.println(best);
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Eric
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BBounding solver = new BBounding();
        solver.solve(1, in, out);
        out.close();
    }

    static class BBounding {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int x = in.nextInt();
            int d = 0;
            int best = 1;
            for (int i = 0; i < n; i++) {
                d += in.nextInt();
                if (d > x) {
                    best = i + 1;
                    break;
                }
                if (i == n - 1)
                    best = n + 1;
            }
            out.println(best);
        }

    }
}

