#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cstring>
using namespace std;
const int maxn=10005;
int n,a[maxn],k;
bool book[maxn][maxn],flag;
bool check(int s,int len){
	int i,j,sum=0;
	for(i=s;i<s+len-1;i++){
		for(j=i+1;j<=s+len-1;j++){
			if(!book[i][j])
				return false;	
		}
		sum+=a[i];
	}
	sum+=a[s+len-1];
	if(sum>=k)
		return true;
	return false;
}
int gcd(int x,int y){
	if(x<y)
		swap(x,y);
	if(y==0){
		return x;
	}
	return gcd(y,x%y);
}
int read(){
	int x=0;
	char ch;
	ch=getchar();
	while(ch<'0'||ch>'9')
		ch=getchar();
	while(ch>='0'&&ch<='9'){
		x=x*10+ch-'0';
		ch=getchar();
	}
	return x;
}
int main(){
	freopen("tarmy.in","r",stdin);
	freopen("tarmy.out","w",stdout);
	int i,j,d;
	n=read();k=read();
	for(i=1;i<=n;i++){
		a[i]=read();
	}
	for(i=1;i<n;i++)
		for(j=i+1;j<=n;j++)
			if(gcd(a[i],a[j])==1)
				book[i][j]=1;
	int temp;
	for(d=n;d>=2;d--){
		for(i=1;i<=n-d+1;i++){
			if(check(i,d)){
				flag=1;
				temp=d;
				break;
			}
		}
		if(flag==1)
			break;
	}
	if(flag==1)
		printf("%d\n",temp);
	else
		printf("0\n");
	fclose(stdin);
	fclose(stdout);
	return 0;
}