#include <cstdio>
#include <cstdlib>
#include <algorithm>

using namespace std;

int A[1000000];
int B[1000000];

int main()
{
    int n, m;
    while (scanf("%d %d", &n, &m) == 2) {
	if (!n)
	    return 0;
	for (int i = 0; i < n; ++i)
	    scanf("%d", A + i);
	B[n] = 0;
	for (int i = n - 1; i >= 0; --i)
	    B[i] = max(A[i], B[i+1]);
	int earn = 0;
	for (int i = 0; i < n; ++i)
	    earn = max(earn, (m / A[i]) * (B[i] - A[i]));
	printf("%d\n", earn);
    }
    return 0;
}