#include <bits/stdc++.h>
using namespace std;



int main() {
    //freopen("be2.txt", "r", stdin);
    int n, k;
    cin >> n >> k;
    
    vector<int> f(n); 
    for(int i = 0;i < n;i++) cin >> f[i];

    int sum = 0;
    int pos = 0;
    
    for(int i = 0;i < n;i++ ) {
    sum += f[i];
    if(sum >= k) {
        pos = i + 1;
        break;
    }
    }
    int ans = pos;
    int left = 0; 


    for(;pos < n;pos++ ) {
        sum+= f[pos];
        for(;left < pos;left++ ) {
            if(sum - f[left] >= k) {
                sum -= f[left];
            } else {
                break;
            }
        }
        ans = min(ans, pos - left + 1); 
    }

    cout << ans << endl;
	return 0;
}