//Code by Lightningfall
//Start coding on ????/??/??
//Finish debugging on ????/??/??
#include<bits/stdc++.h>
using namespace std;
int n,s,tp,id;
int a[500005];
int pre[500005],nxt[500005];
long long f[500005],ff[500005];
int suan(int x,int y){
	long long lc=1ll*x*y/__gcd(x,y);
	return s/lc*lc;
}
int main(){
	scanf("%d%d%d%d",&n,&s,&tp,&id);
	for(int i=1;i<=n;++i)scanf("%d",&a[i]);	
	int B=sqrt(s);
	B=0;
	for(int i=1;i<=n;++i)pre[i]=(a[i-1]<=B?i-1:pre[i-1]);
	for(int i=n;i>=1;--i)nxt[i]=(a[i+1]<=B?i+1:nxt[i+1]);
	for(int i=1;i<=n;++i){
		if(a[i]>B){
			for(int j=a[i];j<=s;j+=a[i])f[i]=max(f[i],ff[j]);
			int x=pre[i];
			for(int j=1;j<=3&&x;--j){
				f[i]=max(f[i],f[x]+suan(a[i],a[x]));
				x=pre[x];
			}
			for(int j=a[i];j<=s;j+=a[i])ff[j]=max(ff[j],f[i]+j);
		}
		int x=nxt[i];
		for(int j=1;j<=3&&x<=n;++j){
			f[x]=max(f[x],f[i]+suan(a[i],a[x]));
			x=nxt[x];
		}
	}
	long long ans=0;
	for(int i=1;i<=n;++i)ans=max(ans,f[i]);
	printf("%lld\n",ans);
	return 0;
}