#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>

#include <iostream>
#include <sstream>
#include <string>

#include <vector>
#include <list>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <algorithm>
using namespace std;

#define FOR(i,n) for(int i=0; i < (n); i++)
#define FORD(i,n) for(int i=(n)-1; i >= 0; i--)
#define FORTO(i,a,b) for (int i = (a); i <= (b); ++i)

#define DEBUG(x) cout << '>' << #x << ' ' << x << endl;
#define SIZE(x) int(x.size())

typedef pair<int, int> PII;
typedef long long ll;

int main()
{
	ll D, M, A;
	while (true) {
		scanf("%lld", &D);
		if (!D) return 0;
		scanf("%lld", &M);
		ll Min = 10000000;
		ll Max = 0;
		FOR(i,D) {
			scanf("%lld", &A);
			Min = min(Min,A);
			Max = max(Max,(M/Min)*(A-Min));
		}
		printf("%lld\n", Max);
	}
	return 0;
}