#include <iostream>
#include <queue>
#include <algorithm>
#define ll long long 
using namespace std;

ll n, p, maxi = 0;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
	cin >> n >> p;
	vector<ll>x(n + 1);
	for (int i = 1; i <= n; ++i)
	{
		ll a;
		cin >> a;
		x[i] = x[i - 1] + a;
		if (a >= p)
		{
			cout << "1";
			return 0;
		}
	}
	if (x[n] < p)
	{
		cout << "0";
		return 0;
	}
	ll mintav = n;
	for (int i = 1; i <= n; ++i)
	{
		ll sum;
		for (int j = i - 1; j > i - mintav + 1; --j)
		{
			if (j > 0)
			{
				sum=x[i]-x[j-1];
				if (sum >= p)
				{
					mintav = i - j + 1;
					break;
				}

			}
			else break;
		}
	}
	cout << mintav;

   return 0;
}