uva1121

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1e5 + 7;
int n, s, input[maxn], sum[maxn] = {0};

int main()
{
	while (cin >> n >> s) {
		for (int i = 0; i < n; i++) {
			cin >> input[i];
			sum[i + 1] = sum[i] + input[i];
		}
		int ans = n + 1;
		for (int i = 1; i <= n; i++) {
			int index = lower_bound(sum, sum + i, sum[i] - s) - sum;
			if (index) ans = min(ans, i - index + 1);
		}
		cout << (ans == (n + 1) ? 0 : ans) << endl;
	}
	return 0;
}

const int maxn = 1e5 + 7;
int n, s, input[maxn], sum[maxn] = {0};

int main()
{
	while (cin >> n >> s) {
		for (int i = 0; i < n; i++) {
			cin >> input[i];
			sum[i + 1] = sum[i] + input[i];
		}
		int ans = n + 1,index = 0;
		for (int i = 1; i <= n; i++) {
			int tmp = sum[i] - s;
			if (sum[index] > tmp)continue;
			while (sum[index] <= tmp)++index;
			ans = min(ans, i - index + 1);
		}
		cout << (ans == (n + 1) ? 0 : ans) << endl;
	}
	return 0;
}