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 = sc.nextInt();
		int x = sc.nextInt();
		int[] m = new int[n];
		
		int min = 0;
		int count = 0;
		
		for (int i = 0; i < n; i++) {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		}
		sc.close();
		Arrays.sort(m);
		min = m[0];
		while(x >= min) {
			x -= min;
			count++;
		}
		System.out.println(count);
	}
} 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 = sc.nextInt();
		int x = sc.nextInt();
		int[] m = new int[n];
		
		int min = 0;
		int count = 0;
		
		for (int i = 0; i < n; i++) {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		}
		sc.close();
		Arrays.sort(m);
		min = m[0];
		while(x >= min) {
			x -= min;
			count++;
		}
		System.out.println(count);
	}
} 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 min = 0;
		int count = 0;
		
		for (int i = 0; i < n; i++) {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		}
		sc.close();
		Arrays.sort(m);
		min = m[0];
		while(x >= min) {
			x -= min;
			count++;
		}
		System.out.println(count);
	} main {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int x = sc.nextInt();
		int[] m = new int[n];
		
		int min = 0;
		int count = 0;
		
		for (int i = 0; i < n; i++) {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		}
		sc.close();
		Arrays.sort(m);
		min = m[0];
		while(x >= min) {
			x -= min;
			count++;
		}
		System.out.println(count);
	} 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 min = 0; min 0 int count = 0; count 0 for (int i = 0; i < n; i++) {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		} {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		} m[i] = sc.nextInt() m[i] m i sc.nextInt() sc.nextInt sc if(x - m[i] > 0) {
				x -= m[i];
				count++;
			} x - m[i] > 0 x - m[i] x m[i] m i 0 {
				x -= m[i];
				count++;
			} x -= m[i] x m[i] m i count++ count sc.close() sc.close sc Arrays.sort(m) Arrays.sort Arrays m min = m[0] min m[0] m 0 while(x >= min) {
			x -= min;
			count++;
		} x >= min x min {
			x -= min;
			count++;
		} x -= min x min count++ count System.out.println(count) System.out.println System.out System System.out count 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 min = 0;
		int count = 0;
		
		for (int i = 0; i < n; i++) {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		}
		sc.close();
		Arrays.sort(m);
		min = m[0];
		while(x >= min) {
			x -= min;
			count++;
		}
		System.out.println(count);
	}
} 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 min = 0;
		int count = 0;
		
		for (int i = 0; i < n; i++) {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		}
		sc.close();
		Arrays.sort(m);
		min = m[0];
		while(x >= min) {
			x -= min;
			count++;
		}
		System.out.println(count);
	}
} 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 = sc.nextInt();
		int x = sc.nextInt();
		int[] m = new int[n];
		
		int min = 0;
		int count = 0;
		
		for (int i = 0; i < n; i++) {
			m[i] = sc.nextInt();
			if(x - m[i] > 0) {
				x -= m[i];
				count++;
			}
		}
		sc.close();
		Arrays.sort(m);
		min = m[0];
		while(x >= min) {
			x -= min;
			count++;
		}
		System.out.println(count);
	}
}
