#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define lnt long long
using namespace std;

const int maxN=100000+5;
lnt gcd(lnt a,lnt b)
{
    return b==0?a:gcd(b,a%b);
}
lnt s[maxN],n,k,sum,lc=1,gc,len,ans;

int main()
{
    freopen("tarmy.in","r",stdin);
    freopen("tarmy.out","w",stdout);

    scanf("%lld %lld",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&s[i]);
        gc=gcd(s[i],lc);
        if(gc==1)
        {
            len++;
            sum+=s[i];
            lc*=s[i];
        }
        else
        {
            sum=s[i];lc=s[i];
            for(int j=1;j<len;j++)
                if(gcd(lc,s[i-j])==1) sum+=s[i-j],lc*=s[i-j];
                else
                {
                    len=j;
                    break;
                }
        }
        //cout<<len<<' ';
        if(sum>=k) ans=max(ans,len);
    }
    if(ans) printf("%lld\n",ans);
    else puts("0\n");

    return 0;
}