#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
int l,r,n,k;
int ans=0;
int s[100001];
int gcd(int a,int b)
{
	return b==0?a:gcd(b,a%b);
}
int pd(int x,int y)
{
	int aa=0;
	for(int ii=x;ii<y;ii++)
	  {
	  	aa=0;
	  	for(int jj=ii+1;jj<=y;jj++)
	  	  {
	  	  	aa=0;
	  	  	if(gcd(s[ii],s[jj])==1) aa+=0;
	  	  	  else aa+=1;
	  	  }
	  }
	if(aa==0) return 0;
	  else return 1;
}
int qiu(int aa,int bb)
{
	int sum=0;
	for(int ii=aa;ii<=bb;ii++)
	  {
	  	sum+=s[ii];
	  }
}
int work()
{
	int ans=0;
	for(int i=0;i<n;i++)
	  {
	  	for(int j=i;j<n;j++)
	  	  {
	  	  	if(pd(i,j)==0)
	  	  	  {
	  	  	  	if(qiu(i,j)<k) continue;
	  	  	  	if(qiu(i,j)>=k)
	  	  	  	  {
	  	  	  	  	ans++;
	  	  	  	  	continue;
	  	  	  	  }
	  	  	  }
	  	  	if(pd(i,j)!=0) break;
	  	  }
	  }
	return ans;
}
int main()
{
	freopen("tarmy.in","r",stdin);
	freopen("tarmy.out","w",stdout);
	cin>>n>>k;
	for(int i=0;i<n;i++)
	  {
	  	cin>>s[i];
	  }
	work();
	cout<<ans;
	fclose(stdin);fclose(stdout);
	return 0; 
}