import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
    }
    
    Scanner sc;
    int N;
    int X;
    int[] m;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        N = sc.nextInt();
        X = sc.nextInt();
        m = new int[N];
        //for (int i=0; i<N; ++i){
        //    m[i] = sc.nextInt();
        //}
    }
    
    //解答処理
    int solve() {
        int count =0;
        
        for (int i=0; i<N; ++i){
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        }
        
        Arrays.sort(m); //昇順にソート
        while (m[0] <= X){
            X -= m[0];
            count++;
        }
        
        
        return count;
    }
    
    //出力
    void show(int answer) {
        System.out.println(answer);
    }
} import java.util.*; util.* java public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
    }
    
    Scanner sc;
    int N;
    int X;
    int[] m;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        N = sc.nextInt();
        X = sc.nextInt();
        m = new int[N];
        //for (int i=0; i<N; ++i){
        //    m[i] = sc.nextInt();
        //}
    }
    
    //解答処理
    int solve() {
        int count =0;
        
        for (int i=0; i<N; ++i){
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        }
        
        Arrays.sort(m); //昇順にソート
        while (m[0] <= X){
            X -= m[0];
            count++;
        }
        
        
        return count;
    }
    
    //出力
    void show(int answer) {
        System.out.println(answer);
    }
} Main Scanner sc; sc int N; N int X; X int[] m; m public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
    } main {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) Main m = new Main(sc); m new Main(sc) m.show(m.solve()) m.show m m.solve() m.solve m String[] args args //入力
    Main(Scanner sc) {
        this.sc = sc;
        N = sc.nextInt();
        X = sc.nextInt();
        m = new int[N];
        //for (int i=0; i<N; ++i){
        //    m[i] = sc.nextInt();
        //}
    } Main {
        this.sc = sc;
        N = sc.nextInt();
        X = sc.nextInt();
        m = new int[N];
        //for (int i=0; i<N; ++i){
        //    m[i] = sc.nextInt();
        //}
    } this.sc = sc this.sc this this.sc sc N = sc.nextInt() N sc.nextInt() sc.nextInt sc X = sc.nextInt() X sc.nextInt() sc.nextInt sc m = new int[N] m new int[N] N Scanner sc sc //解答処理
    int solve() {
        int count =0;
        
        for (int i=0; i<N; ++i){
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        }
        
        Arrays.sort(m); //昇順にソート
        while (m[0] <= X){
            X -= m[0];
            count++;
        }
        
        
        return count;
    } solve {
        int count =0;
        
        for (int i=0; i<N; ++i){
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        }
        
        Arrays.sort(m); //昇順にソート
        while (m[0] <= X){
            X -= m[0];
            count++;
        }
        
        
        return count;
    } int count =0; count 0 for (int i=0; i<N; ++i){
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        } int i=0; int i=0; i 0 i<N i N ++i ++i i {
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        } {
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        } m[i] = sc.nextInt() m[i] m i sc.nextInt() sc.nextInt sc X -= m[i] X m[i] m i count++ count Arrays.sort(m) Arrays.sort Arrays m while (m[0] <= X){
            X -= m[0];
            count++;
        } m[0] <= X m[0] m 0 X {
            X -= m[0];
            count++;
        } X -= m[0] X m[0] m 0 count++ count return count; count //出力
    void show(int answer) {
        System.out.println(answer);
    } show {
        System.out.println(answer);
    } System.out.println(answer) System.out.println System.out System System.out answer int answer answer public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
    }
    
    Scanner sc;
    int N;
    int X;
    int[] m;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        N = sc.nextInt();
        X = sc.nextInt();
        m = new int[N];
        //for (int i=0; i<N; ++i){
        //    m[i] = sc.nextInt();
        //}
    }
    
    //解答処理
    int solve() {
        int count =0;
        
        for (int i=0; i<N; ++i){
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        }
        
        Arrays.sort(m); //昇順にソート
        while (m[0] <= X){
            X -= m[0];
            count++;
        }
        
        
        return count;
    }
    
    //出力
    void show(int answer) {
        System.out.println(answer);
    }
} public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
    }
    
    Scanner sc;
    int N;
    int X;
    int[] m;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        N = sc.nextInt();
        X = sc.nextInt();
        m = new int[N];
        //for (int i=0; i<N; ++i){
        //    m[i] = sc.nextInt();
        //}
    }
    
    //解答処理
    int solve() {
        int count =0;
        
        for (int i=0; i<N; ++i){
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        }
        
        Arrays.sort(m); //昇順にソート
        while (m[0] <= X){
            X -= m[0];
            count++;
        }
        
        
        return count;
    }
    
    //出力
    void show(int answer) {
        System.out.println(answer);
    }
} Main
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
    }
    
    Scanner sc;
    int N;
    int X;
    int[] m;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        N = sc.nextInt();
        X = sc.nextInt();
        m = new int[N];
        //for (int i=0; i<N; ++i){
        //    m[i] = sc.nextInt();
        //}
    }
    
    //解答処理
    int solve() {
        int count =0;
        
        for (int i=0; i<N; ++i){
            m[i] = sc.nextInt();
            X -= m[i];
            count++;
        }
        
        Arrays.sort(m); //昇順にソート
        while (m[0] <= X){
            X -= m[0];
            count++;
        }
        
        
        return count;
    }
    
    //出力
    void show(int answer) {
        System.out.println(answer);
    }
}
