#include <iostream>
#include <sstream>
#include <vector>
#include <cmath>
#include <set>
#include <map>

using namespace std;

int main() {
	
	int d,m;
	int v[70005];
	
	scanf("%d", &d);
	while (d) {
		scanf("%d", &m);
		for (int i=0; i<d; i++) scanf("%d", &v[i]);
		
		int i,j;
		int max = 0;
		for (i=0; i<d; i++)
			for (j=i+1; j<d; j++) {
				if ((m/v[i])*v[j] + m-(m/v[i]*v[i]) > max) max = (m/v[i])*v[j] + m-(m/v[i]*v[i]);
				//printf ("%d %d t%dt %d %d\n", v[i], v[j], v[i]/m, m, max);
			}
		printf("%d\n", max-m > 0 ? max-m : 0);
		scanf("%d", &d);
	}
	
	return 0;
}