#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int N;
int A[20];
ll dp[1<<20];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int K;
    cin >> N >> K;
    dp[0] = K;
    for(int j = 0; j < N; j++) cin >> A[j];
    for(int i = 0; i < (1<<N); i++){
        for(int j = 0; j < N; j++){
            ll m = (ll)1<<j;
            if(m&i) continue;
            dp[i|m] = max(dp[i|m], dp[i]%A[j]); 
        }
    }
    cout << dp[((ll)1<<N)-1] << endl;
}