/*=========================================*
  * Auther: Riolu
  * Time: 2016.11.15
  * ©Copyright 2016 Riolu. All Rights Reserved.
  *=========================================*/
#include <cstdio>
#include <string>
#include <iostream>
using namespace std;
typedef long long ll;
const int N= 1e5+1,N1=2e3+1;
int n,k;
ll s[N];
int a[N];

int gcd(int x,int y){
	if(y==0)return x;
	return gcd(y,x%y);
}

void work(){
	int i,j,ans=0,head=1;
	for(i=1;i<=n;i++){
		for(j=i-1;j>=head;j--)
			if(gcd(a[j],a[i])>1){
				head=j+1;break;
			}
		if(s[i]-s[head-1]>=k && i-head+1>=ans)ans=i-head+1;
	}
	printf("%d\n",ans);
}

void load(){
	freopen("tarmy.in","r",stdin);
	freopen("tarmy.out","w",stdout);
	int i,j;
	scanf("%d%d",&n,&k);
	for(i=1;i<=n;i++){
		scanf("%d",&a[i]);
		s[i]=s[i-1]+a[i];
	}
}

int main(){

	load();
	work();
	/*
	int l=0,r=n+1,m;
	while(l+1<r){
		m=(l+r)>>1;
		if(ck(m))l=m;
		else r=m;
	}
	printf("%d\n",l);
	*/
    return 0;
}
//4 5 12 3 2
//