#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); } 
int s[2001], num[2001], n;
int bird[2001][2001] = {0};
int check(int first, int end) {
	for(int i = first; i <= end-1; i++)
		for(int j = i+1; j <= end; j++){
			if(gcd(num[i],num[j]) == -1) return false;
			else return true;}
	return true;
}
int main()
{
	freopen("tarmy.in","r",stdin);
	freopen("tarmy.out","w",stdout);
	int k, ans = 0, sum = 0;
	s[0] = 0;
	scanf("%d %d", &n, &k);
	for(int i = 1; i <= n; i++) {
		scanf("%d" ,&num[i]);
		sum += num[i];
		s[i] = sum;
	}
	for(int i = 1; i <= n; i++)
		for(int j = 0; j < i; j++){ 
			if((s[i] - s[j]) > k && check(i, j))  ans = max(ans, (i - j)); 
			} 
		puts("0");
		return 0;
}