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

int solve(int n, ll m, vector<int> &v) {
	
	int b = n; ll sum = 0;
	
	int r = 0;
	for (int l = 0; r < n; l++) {
		
		while (r<n && (sum+v[r]) < m) {
			
			sum += ((ll)v[r]);
			r ++;
			
		}
		
		b = min(b, r-l);
		sum -= v[l];
		
	}
	
	return b;
}

int main() {
	
	int n; ll m;
	cin >> n >> m;
	
	vector<int> V(n);
	for (int i = 0; i < n; i++) cin >> V[i];
	
	cout << solve(n, m, V) << "\n";
	return 0;
}