import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int[] values = new int[n]; long length = sc.nextLong(); for (int i = 0; i < n; i++) { values[i] = sc.nextInt(); } Arrays.sort(values); int k = values[n - 1]; long[] costs = new long[k]; Arrays.fill(costs, Long.MAX_VALUE); PriorityQueue queue = new PriorityQueue<>(); queue.add(new Path(0, 0)); while (queue.size() > 0) { Path p = queue.poll(); if (costs[p.idx] <= p.value) { continue; } costs[p.idx] = p.value; for (int i = 0; i < n - 1; i++) { long v = p.value + values[i]; int idx = (int)(v % k); if (costs[idx] == Long.MAX_VALUE) { queue.add(new Path(idx, v)); } } } long ans = length / k; for (int i = 1; i < k; i++) { if (costs[i] < length) { ans += (length - costs[i]) / k + 1; } } System.out.println(ans); } static class Path implements Comparable { int idx; long value; public Path(int idx, long value) { this.idx = idx; this.value = value; } public int compareTo(Path another) { if (value == another.value) { return 0; } else if (value < another.value) { return -1; } else { return 1; } } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }