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

int main() {
    int n, p;
    cin >> n >> p;
    vector<int> k(n+1), prefi(n+1, 0);
    for(int i = 1;i <=n;i++ ) {
        cin >> k[i];
    }
    prefi[1] = k[1];
    for(int i = 2;i<=n;i++ ) {
        prefi[i] = prefi[i-1] + k[i];
    }
    int b = 1;
    int ans = INT_MAX;

    for(int i = 1;i<=n;i++) {
        if(prefi[i] - prefi[b-1] < p) {
            continue;
        }
        ans = min(ans, i-b+1);
        for(int z = b;z < i;z++) {
            if(prefi[i] - prefi[z] >= p) {
                b = z+1;
            } else {
                break;
            }
        }
        ans = min(ans, i-b+1);
    }
    
    cout << ans << endl;
    return 0;
}