#include <cstdio>
#include <algorithm>

int N, K, len[2000005];

int main()
{
    freopen("kite.in","r",stdin);
    freopen("kite.out","w",stdout);
    scanf("%d%d",&N,&K);
    for (int i=1; i<=N; i++) scanf("%d",&len[i]);


    int begin=1, end=1, ans=N+1, sum=len[1];
    while (begin<=N && end<=N)
    {
        if (sum==K)
        {
            ans = std::min(ans, end-begin+1);
            begin++;
            sum -= len[begin-1];
        }
        else if (sum<K)
        {
            end++;
            sum += len[end];
        }
        else
        {
            begin++;
            sum -= len[begin-1];
        }
    }
    if (ans>N) ans=0;
    printf("%d\n",ans);
}