import java.util.*;

public class Main{
	public static void main(String[] args){
    	Scanner scan = new Scanner(System.in);
      	int N = scan.nextInt();
      	int X = scan.nextInt();
      	int[] m = new int[N];
      	int sum = 0;
      	for (int i = 0; i < N; i++){
        	m[i] = scan.nextInt();
        }
      	for (int i = 0; i < N; i++){
        	sum = sum + m[i] ;
        }
      	int min = m[0];
      	for (int i = 0; i < N; i++){
        	if(min > m[i]){
            	min = m[i];
            }
        }
      	int rest = X - sum;
      	int counter = N;
      	while(rest >= min){
        	rest = rest - min;
            counter++;
        }
      	System.out.print(counter);
    }
} import java.util.*; util.* java public class Main{
	public static void main(String[] args){
    	Scanner scan = new Scanner(System.in);
      	int N = scan.nextInt();
      	int X = scan.nextInt();
      	int[] m = new int[N];
      	int sum = 0;
      	for (int i = 0; i < N; i++){
        	m[i] = scan.nextInt();
        }
      	for (int i = 0; i < N; i++){
        	sum = sum + m[i] ;
        }
      	int min = m[0];
      	for (int i = 0; i < N; i++){
        	if(min > m[i]){
            	min = m[i];
            }
        }
      	int rest = X - sum;
      	int counter = N;
      	while(rest >= min){
        	rest = rest - min;
            counter++;
        }
      	System.out.print(counter);
    }
} Main public static void main(String[] args){
    	Scanner scan = new Scanner(System.in);
      	int N = scan.nextInt();
      	int X = scan.nextInt();
      	int[] m = new int[N];
      	int sum = 0;
      	for (int i = 0; i < N; i++){
        	m[i] = scan.nextInt();
        }
      	for (int i = 0; i < N; i++){
        	sum = sum + m[i] ;
        }
      	int min = m[0];
      	for (int i = 0; i < N; i++){
        	if(min > m[i]){
            	min = m[i];
            }
        }
      	int rest = X - sum;
      	int counter = N;
      	while(rest >= min){
        	rest = rest - min;
            counter++;
        }
      	System.out.print(counter);
    } main {
    	Scanner scan = new Scanner(System.in);
      	int N = scan.nextInt();
      	int X = scan.nextInt();
      	int[] m = new int[N];
      	int sum = 0;
      	for (int i = 0; i < N; i++){
        	m[i] = scan.nextInt();
        }
      	for (int i = 0; i < N; i++){
        	sum = sum + m[i] ;
        }
      	int min = m[0];
      	for (int i = 0; i < N; i++){
        	if(min > m[i]){
            	min = m[i];
            }
        }
      	int rest = X - sum;
      	int counter = N;
      	while(rest >= min){
        	rest = rest - min;
            counter++;
        }
      	System.out.print(counter);
    } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int N = scan.nextInt(); N scan.nextInt() scan.nextInt scan int X = scan.nextInt(); X scan.nextInt() scan.nextInt scan int[] m = new int[N]; m new int[N] N int sum = 0; sum 0 for (int i = 0; i < N; i++){
        	m[i] = scan.nextInt();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
        	m[i] = scan.nextInt();
        } {
        	m[i] = scan.nextInt();
        } m[i] = scan.nextInt() m[i] m i scan.nextInt() scan.nextInt scan for (int i = 0; i < N; i++){
        	sum = sum + m[i] ;
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
        	sum = sum + m[i] ;
        } {
        	sum = sum + m[i] ;
        } sum = sum + m[i] sum sum + m[i] sum m[i] m i int min = m[0]; min m[0] m 0 for (int i = 0; i < N; i++){
        	if(min > m[i]){
            	min = m[i];
            }
        } int i = 0; int i = 0; i 0 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 int rest = X - sum; rest X - sum X sum int counter = N; counter N while(rest >= min){
        	rest = rest - min;
            counter++;
        } rest >= min rest min {
        	rest = rest - min;
            counter++;
        } rest = rest - min rest rest - min rest min counter++ counter System.out.print(counter) System.out.print System.out System System.out counter String[] args args public class Main{
	public static void main(String[] args){
    	Scanner scan = new Scanner(System.in);
      	int N = scan.nextInt();
      	int X = scan.nextInt();
      	int[] m = new int[N];
      	int sum = 0;
      	for (int i = 0; i < N; i++){
        	m[i] = scan.nextInt();
        }
      	for (int i = 0; i < N; i++){
        	sum = sum + m[i] ;
        }
      	int min = m[0];
      	for (int i = 0; i < N; i++){
        	if(min > m[i]){
            	min = m[i];
            }
        }
      	int rest = X - sum;
      	int counter = N;
      	while(rest >= min){
        	rest = rest - min;
            counter++;
        }
      	System.out.print(counter);
    }
} public class Main{
	public static void main(String[] args){
    	Scanner scan = new Scanner(System.in);
      	int N = scan.nextInt();
      	int X = scan.nextInt();
      	int[] m = new int[N];
      	int sum = 0;
      	for (int i = 0; i < N; i++){
        	m[i] = scan.nextInt();
        }
      	for (int i = 0; i < N; i++){
        	sum = sum + m[i] ;
        }
      	int min = m[0];
      	for (int i = 0; i < N; i++){
        	if(min > m[i]){
            	min = m[i];
            }
        }
      	int rest = X - sum;
      	int counter = N;
      	while(rest >= min){
        	rest = rest - min;
            counter++;
        }
      	System.out.print(counter);
    }
} Main
import java.util.*;

public class Main{
	public static void main(String[] args){
    	Scanner scan = new Scanner(System.in);
      	int N = scan.nextInt();
      	int X = scan.nextInt();
      	int[] m = new int[N];
      	int sum = 0;
      	for (int i = 0; i < N; i++){
        	m[i] = scan.nextInt();
        }
      	for (int i = 0; i < N; i++){
        	sum = sum + m[i] ;
        }
      	int min = m[0];
      	for (int i = 0; i < N; i++){
        	if(min > m[i]){
            	min = m[i];
            }
        }
      	int rest = X - sum;
      	int counter = N;
      	while(rest >= min){
        	rest = rest - min;
            counter++;
        }
      	System.out.print(counter);
    }
}