#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <cassert>
#include <cmath>
#include <cstdlib>

using namespace std;

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

#define pb push_back
#define fi first
#define se second

int main(){
	for(;;){
		int D, M;
		scanf("%d", &D);
		if(D == 0)
			break;

		scanf("%d", &M);

		vector<int> P(D);
		for(int i = 0; i < D; ++i)
			scanf("%d", &P[i]);

		int res = 0;
		int best = 0;

		for(int i = D - 1; i >= 0; --i){
			res = max(res, M % P[i] + (M / P[i]) * best - M);
			best = max(best, P[i]);
		}

		printf("%d\n", res);
	}
	return 0;
}