#include<cstdio>
#include<iostream>
#define LL long long
using namespace std;
const int maxn=100010;
int n,m,l,r,res;
int a[maxn];
LL gcd(LL x,LL y)
{
	if(y==0) return x;
	else return gcd(y,x%y); 
}
bool check(int lim)
{
	for(int i=1;i<=n;i++)
	{
		LL lcm=a[i],cnt=a[i];bool ok=false;
		for(int j=i+1;j<=i+lim-1;j++)
		{
			if(gcd(a[j],lcm)==1)
			{
				cnt+=a[j];lcm*=a[j];
			}
			else
			{
				ok=true;break;
			}
		}
		if(ok) continue;
		if(cnt>=m) return true;
	}
	return false;
}
int main()
{
	freopen("tarmy.in","r",stdin);
	freopen("tarmy.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	l=0,r=n;
	while(r>=l)
	{
		int mid=(l+r)>>1;
		if(check(mid)) res=mid,r=mid-1;
		else l=mid+1;
	}
	printf("%d",res);
	return 0;
}
/*
5 14
4 5 12 3 2 
*/