#include<bits/stdc++.h>
#define inl inline
using namespace std;
typedef long long ll;
const int N=5e5+5,B=710,IB=1<<21; char IN[IB],*IS=IN+IB,*IT=IS,OU[IB],*OS=OU,*OT=OS+IB;
#define getchar() (IS==IT&&(IT=IN+fread(IS=IN,1,IB,stdin)),IS==IT?EOF:*IS++)
#define flush() (fwrite(OU,1,OS-OU,stdout),OS=OU)
#define putchar(x) (OS==OT&&flush(),*OS++=x)
int n,m,T,sq,gc[B][B],a[N]; ll f[N],g[N],h[N];
inl int Read()
{
	int s=0; char c; while(!isdigit(c=getchar()));
	for(;isdigit(c);c=getchar()) s=s*10+c-'0'; return s;
}
inl void Write(ll x,char y)
{
	int c=0,s[20]; do s[++c]=x%10; while(x/=10);
	while(c) putchar(s[c--]+'0'); putchar(y);
}
inl int GCD(int x,int y) {return y?(x<=sq&&y<=sq?gc[x][y]:GCD(y,x%y)):x; }
inl ll G(int i,int j) {ll t=a[i]/GCD(a[i],a[j])*a[j]; return m/t*t; }
inl void Solve()
{
	memset(h,0,sizeof(h));
	for(int i=1,j=1,k,c;i<=n;++i)
	{
		f[i]=max(f[i-1],f[i]); for(;f[j]+m<=f[i-1];++j);
		if(i-j<=100) for(k=j;k<i;++k) f[i]=max(f[k]+G(k,i),f[i]);
		else if(a[i]<=sq)
		{
			for(c=1,k=i-1;k&&(c+=a[k]<=sq)<=3;--k) f[i]=max(f[k]+G(k,i),f[i]);
			for(c=1,k=i+1;k<=n&&(c+=a[k]<=sq)<=3;++k) f[k]=max(f[i]+G(i,k),f[k]);
		}
		else
		{
			for(k=a[i];k<=m;k+=a[i]) f[i]=max(h[k],f[i]);
			for(k=a[i];k<=m;k+=a[i]) h[k]=max(f[i]+k,h[k]);
		}
//~ cerr<<i<<"  "<<f[i]<<"\n";
	}
}
int main()
{
	int on=Read(); m=Read(); T=Read(); Read(); sq=sqrt(m);
//~ cerr<<sq<<'\n';
	for(int i=0,j;i<=sq;++i) for(j=i;j<=sq;++j) gc[i][j]=gc[j][i]=__gcd(i,j);
	for(int i=1,t;i<=on;++i) (t=Read())<=m&&(a[++n]=t);
	Solve(); Write(f[n],' '); if(T)
	{
		
	}
	flush(); return 0;
}