#include <iostream>

using namespace std;

const int MAX_D = 70002;

int main()
{
	int p[MAX_D];
	while(1)
	{
		int n, m;
		cin >> n;
		if(n == 0)
			break;
		cin >> m;
		for(int i = 0; i < n; i++)
			cin >> p[i];
		int max_diff = 0;
		for(int i = 0; i < n; i++)
		{
			int count = m / p[i];
			for(int j = i; j < n; j++)
			{				
				int diff = (p[j] - p[i]) * count;
				if(diff > max_diff)
					max_diff = diff;
			}
		}
		cout << max_diff << endl;
	}
	return 0;
}