import java.util.*;

public 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];
        int sum = 0;
        
        for(int i=0; i<N; i++){
            m[i] = sc.nextInt();
            sum +=m[i];
        }
        
        int nokori = X -sum;
        int ans =0;
        int min = m[0];
        
        for(int i=1; i<N; i++){
            if(min>m[i]){
                min = m[i];
            }
        }
        
        ans =N + (int)nokori/min;
        
        System.out.println(ans);
    }
} import java.util.*; util.* java public 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];
        int sum = 0;
        
        for(int i=0; i<N; i++){
            m[i] = sc.nextInt();
            sum +=m[i];
        }
        
        int nokori = X -sum;
        int ans =0;
        int min = m[0];
        
        for(int i=1; i<N; i++){
            if(min>m[i]){
                min = m[i];
            }
        }
        
        ans =N + (int)nokori/min;
        
        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];
        int sum = 0;
        
        for(int i=0; i<N; i++){
            m[i] = sc.nextInt();
            sum +=m[i];
        }
        
        int nokori = X -sum;
        int ans =0;
        int min = m[0];
        
        for(int i=1; i<N; i++){
            if(min>m[i]){
                min = m[i];
            }
        }
        
        ans =N + (int)nokori/min;
        
        System.out.println(ans);
    } main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int [] m = new int [N];
        int sum = 0;
        
        for(int i=0; i<N; i++){
            m[i] = sc.nextInt();
            sum +=m[i];
        }
        
        int nokori = X -sum;
        int ans =0;
        int min = m[0];
        
        for(int i=1; i<N; i++){
            if(min>m[i]){
                min = m[i];
            }
        }
        
        ans =N + (int)nokori/min;
        
        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 int sum = 0; sum 0 for(int i=0; i<N; i++){
            m[i] = sc.nextInt();
            sum +=m[i];
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            m[i] = sc.nextInt();
            sum +=m[i];
        } {
            m[i] = sc.nextInt();
            sum +=m[i];
        } m[i] = sc.nextInt() m[i] m i sc.nextInt() sc.nextInt sc sum +=m[i] sum m[i] m i int nokori = X -sum; nokori X -sum X sum int ans =0; ans 0 int min = m[0]; min m[0] m 0 for(int i=1; i<N; i++){
            if(min>m[i]){
                min = m[i];
            }
        } int i=1; int i=1; i 1 i<N i N i++ i++ i {
            if(min>m[i]){
                min = m[i];
            }
        } {
            if(min>m[i]){
                min = m[i];
            }
        } if(min>m[i]){
                min = m[i];
            } min>m[i] min m[i] m i {
                min = m[i];
            } min = m[i] min m[i] m i ans =N + (int)nokori/min ans N + (int)nokori/min N (int)nokori/min (int)nokori min System.out.println(ans) System.out.println System.out System System.out ans String[] args args public 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];
        int sum = 0;
        
        for(int i=0; i<N; i++){
            m[i] = sc.nextInt();
            sum +=m[i];
        }
        
        int nokori = X -sum;
        int ans =0;
        int min = m[0];
        
        for(int i=1; i<N; i++){
            if(min>m[i]){
                min = m[i];
            }
        }
        
        ans =N + (int)nokori/min;
        
        System.out.println(ans);
    }
} public 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];
        int sum = 0;
        
        for(int i=0; i<N; i++){
            m[i] = sc.nextInt();
            sum +=m[i];
        }
        
        int nokori = X -sum;
        int ans =0;
        int min = m[0];
        
        for(int i=1; i<N; i++){
            if(min>m[i]){
                min = m[i];
            }
        }
        
        ans =N + (int)nokori/min;
        
        System.out.println(ans);
    }
} Main
import java.util.*;

public 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];
        int sum = 0;
        
        for(int i=0; i<N; i++){
            m[i] = sc.nextInt();
            sum +=m[i];
        }
        
        int nokori = X -sum;
        int ans =0;
        int min = m[0];
        
        for(int i=1; i<N; i++){
            if(min>m[i]){
                min = m[i];
            }
        }
        
        ans =N + (int)nokori/min;
        
        System.out.println(ans);
    }
}
