#include <iostream>
using namespace std;

const int MAXN = 230010;
long long a[MAXN];
int n;
long long m;

// 检查是否存在长度为L的子数组满足和≥m
bool check(int L) {
    long long sum = 0;
    // 初始窗口
    for (int i = 0; i < L; i++) {
        sum += a[i];
        if (sum >= m) return true;
    }
    // 滑动窗口
    for (int i = L; i < n; i++) {
        sum = sum - a[i - L] + a[i];
        if (sum >= m) return true;
    }
    return false;
}

int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
   
/**************************************************************
	Problem: 2105
	User: zhengzihao
	Language: C++
	Result: Compile Error
****************************************************************/