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

ostream& operator<<(ostream& os, vector<int>& input)
{
    for (auto i : input)
    {
        os << i << " ";
    }
    return os;
}

int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;
    vector<int>vec(n);
    for (size_t i = 0; i < n; i++) cin >> vec[i];

    int i = 0, j = 0, s = 0, m = 1000001;
    while (i < n)
    {
        while (s < k && j < n)
        {
            s += vec[j];
            j++;
        }
        if (s >= k) m = min(m, j - i);
        s -= vec[i];
        i++;
    }
    cout << m << endl;
    return 0;
}
/*
8 11
3 6 4 2 3 7 2 9
-2
*/