import java.util.*;

class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] m = new int[N];
        for(int i = 0; i < N; i++){
            m[i] = sc.nextInt();
        }

        int remain = X;
        int min = 1100;
        for(int i = 0; i < N; i++){
            remain -= m[i]; 
            min = Math.min(min, m[i]);
        }

        int ans = 0;
        if(remain == 0) ans = m.length;
        else ans = (remain - (remain % min)) / min + m.length;
        System.out.println(ans);
    }
} import java.util.*; util.* java class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] m = new int[N];
        for(int i = 0; i < N; i++){
            m[i] = sc.nextInt();
        }

        int remain = X;
        int min = 1100;
        for(int i = 0; i < N; i++){
            remain -= m[i]; 
            min = Math.min(min, m[i]);
        }

        int ans = 0;
        if(remain == 0) ans = m.length;
        else ans = (remain - (remain % min)) / min + m.length;
        System.out.println(ans);
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] m = new int[N];
        for(int i = 0; i < N; i++){
            m[i] = sc.nextInt();
        }

        int remain = X;
        int min = 1100;
        for(int i = 0; i < N; i++){
            remain -= m[i]; 
            min = Math.min(min, m[i]);
        }

        int ans = 0;
        if(remain == 0) ans = m.length;
        else ans = (remain - (remain % min)) / min + m.length;
        System.out.println(ans);
    } main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] m = new int[N];
        for(int i = 0; i < N; i++){
            m[i] = sc.nextInt();
        }

        int remain = X;
        int min = 1100;
        for(int i = 0; i < N; i++){
            remain -= m[i]; 
            min = Math.min(min, m[i]);
        }

        int ans = 0;
        if(remain == 0) ans = m.length;
        else ans = (remain - (remain % min)) / min + m.length;
        System.out.println(ans);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int X = sc.nextInt(); X sc.nextInt() sc.nextInt sc int[] m = new int[N]; m new int[N] N for(int i = 0; i < N; i++){
            m[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            m[i] = sc.nextInt();
        } {
            m[i] = sc.nextInt();
        } m[i] = sc.nextInt() m[i] m i sc.nextInt() sc.nextInt sc int remain = X; remain X int min = 1100; min 1100 for(int i = 0; i < N; i++){
            remain -= m[i]; 
            min = Math.min(min, m[i]);
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            remain -= m[i]; 
            min = Math.min(min, m[i]);
        } {
            remain -= m[i]; 
            min = Math.min(min, m[i]);
        } remain -= m[i] remain m[i] m i min = Math.min(min, m[i]) min Math.min(min, m[i]) Math.min Math min m[i] m i int ans = 0; ans 0 if(remain == 0) ans = m.length;
        else ans = (remain - (remain % min)) / min + m.length; remain == 0 remain 0 ans = m.length ans m.length m m.length ans = (remain - (remain % min)) / min + m.length ans (remain - (remain % min)) / min + m.length (remain - (remain % min)) / min (remain - (remain % min)) remain (remain % min) remain min min m.length m m.length System.out.println(ans) System.out.println System.out System System.out ans String[] args args
import java.util.*;

class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int[] m = new int[N];
        for(int i = 0; i < N; i++){
            m[i] = sc.nextInt();
        }

        int remain = X;
        int min = 1100;
        for(int i = 0; i < N; i++){
            remain -= m[i]; 
            min = Math.min(min, m[i]);
        }

        int ans = 0;
        if(remain == 0) ans = m.length;
        else ans = (remain - (remain % min)) / min + m.length;
        System.out.println(ans);
    }
}