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

using namespace std;

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