#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 1000000007; // constexpr int MOD = 998244353; constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { constexpr int M = 1000000; int n; ll l; cin >> n >> l; vector w(n); REP(i, n) cin >> w[i]; ll dist[M + 1]{}; fill(dist, dist + (M + 1), LINF); priority_queue, vector>, greater>> que; REP(i, n) { dist[w[i]] = w[i]; que.emplace(w[i], w[i]); } while (!que.empty()) { const auto [d, node] = que.top(); que.pop(); if (d > dist[node]) continue; REP(i, n) { const int dst = (node + w[i]) % (M + 1); if (chmin(dist[dst], dist[node] + w[i])) que.emplace(dist[dst], dst); } } ll ans = l + 1; REP(i, M + 1) ans -= min(dist[i] / (M + 1), l / (M + 1) + (l % (M + 1) >= i)); cout << ans << '\n'; return 0; }