#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
typedef long long ll;
const int N=1e6+5;
int a[230002];
int main()
{
	int n,m,sum=0,l=1,ans;
	cin>>n>>m;
	ans=n+1;
	rep(i,1,n) scanf("%d",&a[i]);
	
	rep(r,1,n)
	{
		sum+=a[r];
		while(sum>=m)
		{
			ans=min(ans,r-l+1);
			sum-=a[l++];
		}
	}
	if(ans==n+1) cout<<0;
	else cout<<ans;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int MAX=230010;
int n,m,a[MAX],p[MAX];
bool check(int mid){
	for (int i=1;i<=n-mid+1;i++){
		if (p[i+mid-1]-p[i-1]>=m)return true;
	}
	return false;
}
int main(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		p[i]=p[i-1]+a[i];
	}
	int l=1,r=n,mid;
	while (l<=r){
		mid=l+r>>1;
		check(mid)?r=mid-1:l=mid+1;
	}
	printf("%d",l==n+1?0:l);
	return 0;
}