#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int>> vv32;
typedef vector<vector<ll>> vv64;
typedef vector<vector<p64>> vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

const int nMax = 100000;
vector<int> prefixSum(nMax + 1);

int binarySearch(int i, int j, int val)
{
    /// prefixSum[i] should be <= val
    int m;
    while (i <= j)
    {
        m = i + (j - i) / 2;
        if (prefixSum[m] == val)
            return m;
        else if (prefixSum[m] > val)
        {
            j = m - 1;
        }
        else
        {
            i = m + 1;
        }
    }
    return j;
}

int main()
{
    //ifstream cin("be.txt");

    int n;
    cin >> n;

    int p;
    cin >> p;

    for (int i = 1; i <= n; i++)
    {
        int a;
        cin >> a;
        prefixSum[i] = prefixSum[i - 1] + a;

        //cout<<prefixSum[i]<<" ";
    }


    int ans = nMax;
    for (int i = n; i >= 1; i--)
    {

        int val = prefixSum[i] - p;
        if (val >= 0)
        {
            //cout<<i<<" ";
            int j = binarySearch(0, i - 1, val);
            //cout<<i<<" "<<j<<ln;
            ans = min(ans, i - j);
        }
    }
    //cout<<ln;
    cout << ans;

    return 0;
}