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];
        int[] costs = new int[k];
        Arrays.fill(costs, Integer.MAX_VALUE);
        PriorityQueue<Path> 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++) {
                int idx = p.idx + values[i];
                if (idx >= k) {
                    idx -= k;
                    if (costs[idx] == Integer.MAX_VALUE) {
                        queue.add(new Path(idx, p.value + 1));
                    }
                } else {
                    if (costs[idx] == Integer.MAX_VALUE) {
                        queue.add(new Path(idx, p.value));
                    }
                }
            }
        }
        long ans = length / k;
        for (int i = 1; i < k; i++) {
            long c = (long)k * costs[i] + i;
            if (c < length) {
                ans += (length - c) / k + 1;
            }
        }
        System.out.println(ans);
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        int value;
        
        public Path(int idx, int value) {
            this.idx = idx;
            this.value = value;
        }
        
        public int compareTo(Path another) {
            return value - another.value;
        }
    }
}
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();
    }
}