import java.util.Scanner;

class Solution{
    static int findLengthOfSmallestSubarray(int[] a, int K) {
        int n=a.length;
		int k=K;
		int i=0, j=0;
		int sum=a[0];
		int ans=n+1;
		while(j<n){
			if(sum>=k){
				ans=Math.min(ans, j-i+1);
				sum-=a[i];
				i++;
			}
			else {
				j++;
				if(j<n)sum+=a[j];
			}
		}

		if(ans==n+1)return 0;
		else return ans;
    }
}
public class Main{
    public static void main(String[] args) {
        Scanner keyboard = new Scanner(System.in);
        int n = keyboard.nextInt();
		int K = keyboard.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++) {
            a[i] = keyboard.nextInt();
        }
        keyboard.close();
        System.out.println(Solution.findLengthOfSmallestSubarray(a, K));
    }
}