import java.util.*;

public class Main {
    static int n;
    static int[] values;
    static HashMap<Integer, HashMap<Integer, Integer>> dp = new HashMap<>();
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        int k = sc.nextInt();
        values = new int[n];
        for (int i = 0; i < n; i++) {
            values[i] = sc.nextInt();
        }
        System.out.println(dfw((1 << n) - 1, k));
    }
    
    static int dfw(int key, int value) {
        if (key == 0) {
            return value;
        }
        if (dp.containsKey(key)) {
            if (dp.get(key).containsKey(value)) {
                return dp.get(key).get(value);
            }
        } else {
            dp.put(key, new HashMap<>());
        }
        int tmp = key;
        for (int i = 0; i < n; i++) {
            if ((tmp & (1 << i)) == 0) {
                continue;
            }
            if (values[i] > value) {
                tmp ^= (1 << i);
            }
        }
        if (tmp == 0) {
            dp.get(key).put(value, value);
            return value;
        }
        int max = 0;
        for (int i = 0; i < n; i++) {
            if ((tmp & (1 << i)) == 0) {
                continue;
            }
            max = Math.max(max, dfw(tmp ^ (1 << i), value % values[i]));
        }
        dp.get(key).put(value, max);
        return max;
    }
}