#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
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, s = 0;
    cin >> n >> k;
    map<int, int>mp;
    vector<int> vec(n);
    for (size_t i = 0; i < n; i++)
    {
        int a;
        cin >> a;
        s += a;
        vec[i] = s;
        mp[s] = i;
    }


    int m = 1000001;
    for (int i = 0; i < n; i++)
    {
       auto it = mp.find(vec[i] + k);
        if (it != mp.end())
        {
            m = min(m, mp[vec[i] + k] - i);
        }
    }
    cout << m << endl;
    return 0;
}
/*
8 11
3 6 4 2 3 7 2 9
-2
*/