#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 110;
int c,n;
int t[maxn];
int ans;

int main(){
	#ifndef DEBUG
		string FileName="fireshow";
		freopen((FileName+".in").c_str(),"r",stdin);
		freopen((FileName+".out").c_str(),"w",stdout);
	#endif
	scanf("%d%d",&c,&n);
	for(int i = 1; i <= c; i++)scanf("%d",&t[i]);
	sort(t+1,t+c+1);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= c; j++){
			if(i % t[j] == 0){
				ans++;
				break;
				//printf("i=%d,j=%d,t[j]=%d\n",i,j,t[j]);
			}
		}
	}
	printf("%d",ans);
}