// D - Semi Common Multiple
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b){return a/gcd(a,b)*b;}

int main(){
	int T=-1,N,M; scanf("%d%d",&N,&M);
	ll L=1;
	while(N--){
		int a,t; scanf("%d",&a);
		for(t=0; !(a&1); t++) a>>=1;
		if(T>0 && t!=T || (L=lcm(L, a)) > M){ puts("0"); return 0; }
		T = t;
	}
	printf("%lld\n",((M>>(T-1))/L+2-1)/2);
}