import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); long l = nl(); int[] w = na(n); // int m = Arrays.stream(w).max().getAsInt(); var gen = new Random(); int m = w[gen.nextInt(n)]; var dp = dijkstra(w, m); long ret = 0; for (int i = 0; i < m; i++) { if (dp[i] < 0 || dp[i] > l) continue; ret += (l - dp[i]) / m + 1; } System.out.println(ret - 1); } private static long[] dijkstra(int[] a, int m) { final long[] d = new long[m]; Arrays.fill(d, Long.MAX_VALUE / 2); d[0] = 0; PriorityQueue q = new PriorityQueue<>((o1, o2) -> Long.compare(d[(int) o1[0]], d[(int) o2[0]])); int n = a.length; q.add(new long[] { 0, 0 }); while (!q.isEmpty()) { var p = q.poll(); int v = (int) p[0]; var dv = p[1]; if (dv > d[v]) continue; for (int i = 0; i < n; i++) { int nv = (a[i] + v) % m; var nd = dv + a[i]; if (nd < d[nv]) { d[nv] = nd; q.add(new long[] { nv, nd }); } } } return Arrays.stream(d).map(v -> v >= Long.MAX_VALUE / 2 ? -1 : v).toArray(); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }