import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int X = Integer.parseInt(sc.next());
		int[] M = new int[N];
		for(int i = 0;i < N;i++) {
			M[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(M);
		int sum = 0;
		int cnt = N;
		for(int i = 0;i < N;i++) {
			sum += M[i];
		}
		if(X - sum >= M[0]) {
			do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]);
		}
		System.out.println(cnt);
	}
} import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int X = Integer.parseInt(sc.next());
		int[] M = new int[N];
		for(int i = 0;i < N;i++) {
			M[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(M);
		int sum = 0;
		int cnt = N;
		for(int i = 0;i < N;i++) {
			sum += M[i];
		}
		if(X - sum >= M[0]) {
			do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]);
		}
		System.out.println(cnt);
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int X = Integer.parseInt(sc.next());
		int[] M = new int[N];
		for(int i = 0;i < N;i++) {
			M[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(M);
		int sum = 0;
		int cnt = N;
		for(int i = 0;i < N;i++) {
			sum += M[i];
		}
		if(X - sum >= M[0]) {
			do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]);
		}
		System.out.println(cnt);
	} main {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int X = Integer.parseInt(sc.next());
		int[] M = new int[N];
		for(int i = 0;i < N;i++) {
			M[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(M);
		int sum = 0;
		int cnt = N;
		for(int i = 0;i < N;i++) {
			sum += M[i];
		}
		if(X - sum >= M[0]) {
			do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]);
		}
		System.out.println(cnt);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = Integer.parseInt(sc.next()); N Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int X = Integer.parseInt(sc.next()); X Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int[] M = new int[N]; M new int[N] N for(int i = 0;i < N;i++) {
			M[i] = Integer.parseInt(sc.next());
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			M[i] = Integer.parseInt(sc.next());
		} {
			M[i] = Integer.parseInt(sc.next());
		} M[i] = Integer.parseInt(sc.next()) M[i] M i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc sc.close() sc.close sc Arrays.sort(M) Arrays.sort Arrays M int sum = 0; sum 0 int cnt = N; cnt N for(int i = 0;i < N;i++) {
			sum += M[i];
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			sum += M[i];
		} {
			sum += M[i];
		} sum += M[i] sum M[i] M i if(X - sum >= M[0]) {
			do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]);
		} X - sum >= M[0] X - sum X sum M[0] M 0 {
			do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]);
		} do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]); X - sum >= M[0] X - sum X sum M[0] M 0 {
				sum += M[0];
				cnt++;
			} sum += M[0] sum M[0] M 0 cnt++ cnt System.out.println(cnt) System.out.println System.out System System.out cnt String[] args args public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int X = Integer.parseInt(sc.next());
		int[] M = new int[N];
		for(int i = 0;i < N;i++) {
			M[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(M);
		int sum = 0;
		int cnt = N;
		for(int i = 0;i < N;i++) {
			sum += M[i];
		}
		if(X - sum >= M[0]) {
			do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]);
		}
		System.out.println(cnt);
	}
} public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int X = Integer.parseInt(sc.next());
		int[] M = new int[N];
		for(int i = 0;i < N;i++) {
			M[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(M);
		int sum = 0;
		int cnt = N;
		for(int i = 0;i < N;i++) {
			sum += M[i];
		}
		if(X - sum >= M[0]) {
			do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]);
		}
		System.out.println(cnt);
	}
} Main
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int X = Integer.parseInt(sc.next());
		int[] M = new int[N];
		for(int i = 0;i < N;i++) {
			M[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(M);
		int sum = 0;
		int cnt = N;
		for(int i = 0;i < N;i++) {
			sum += M[i];
		}
		if(X - sum >= M[0]) {
			do{
				sum += M[0];
				cnt++;
			}while(X - sum >= M[0]);
		}
		System.out.println(cnt);
	}
}