#include /** * @title Fixed point combinator * @docs fix_point.md */ template struct FixPoint : F{ explicit constexpr FixPoint(F &&f) noexcept : F(std::forward(f)){} template constexpr auto operator()(Args &&... args) const { return F::operator()(*this, std::forward(args)...); } }; template inline constexpr auto make_fix_point(F &&f){ return FixPoint(std::forward(f)); } template inline constexpr auto make_fix_point(F &f){ return FixPoint(std::forward(f)); } int main(){ int N, K; while(std::cin >> N >> K){ std::vector A(N); for(int i = 0; i < N; ++i) std::cin >> A[i]; auto dp = std::vector(N+1, std::vector(1 << N)); auto check = std::vector(N+1, std::vector(1 << N)); const int mask = (1 << N) - 1; auto f = make_fix_point( [&](auto &&f, int i, int s) -> int{ if(check[i][s]) return dp[i][s]; check[i][s] = true; if(i == 0 or s == 0) return dp[i][s] = K; for(int k = 0; k < N; ++k){ if(s & (1 << k)){ dp[i][s] = std::max(dp[i][s], f(i-1, s ^ (1 << k)) % A[k]); } } return dp[i][s]; } ); int ans = f(N, mask); std::cout << ans << "\n"; } return 0; }