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[] variation = new int[N];
		int count = 0;
		int i,j,k =0;
		int[] max = new int[N];
		
		for(i=0;i<N;i++){
			variation[i] = sc.nextInt();
		}
		
		for(j=0;j<N;j++){
			X = X - variation[j];
			count++;
		}
		
		for(k=0;k<N;k++){
			max[k]=X/variation[k];
		}
		
		for(j=0;j<N;j++){
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		}
		
		count = count + max[0];
		
		System.out.println(count);
	}
} 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[] variation = new int[N];
		int count = 0;
		int i,j,k =0;
		int[] max = new int[N];
		
		for(i=0;i<N;i++){
			variation[i] = sc.nextInt();
		}
		
		for(j=0;j<N;j++){
			X = X - variation[j];
			count++;
		}
		
		for(k=0;k<N;k++){
			max[k]=X/variation[k];
		}
		
		for(j=0;j<N;j++){
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		}
		
		count = count + max[0];
		
		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[] variation = new int[N];
		int count = 0;
		int i,j,k =0;
		int[] max = new int[N];
		
		for(i=0;i<N;i++){
			variation[i] = sc.nextInt();
		}
		
		for(j=0;j<N;j++){
			X = X - variation[j];
			count++;
		}
		
		for(k=0;k<N;k++){
			max[k]=X/variation[k];
		}
		
		for(j=0;j<N;j++){
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		}
		
		count = count + max[0];
		
		System.out.println(count);
	} main {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int X = sc.nextInt();
		int[] variation = new int[N];
		int count = 0;
		int i,j,k =0;
		int[] max = new int[N];
		
		for(i=0;i<N;i++){
			variation[i] = sc.nextInt();
		}
		
		for(j=0;j<N;j++){
			X = X - variation[j];
			count++;
		}
		
		for(k=0;k<N;k++){
			max[k]=X/variation[k];
		}
		
		for(j=0;j<N;j++){
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		}
		
		count = count + max[0];
		
		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[] variation = new int[N]; variation new int[N] N int count = 0; count 0 int i i j j k =0; k 0 int[] max = new int[N]; max new int[N] N for(i=0;i<N;i++){
			variation[i] = sc.nextInt();
		} i=0; i=0 i 0 i<N i N i++ i++ i {
			variation[i] = sc.nextInt();
		} {
			variation[i] = sc.nextInt();
		} variation[i] = sc.nextInt() variation[i] variation i sc.nextInt() sc.nextInt sc for(j=0;j<N;j++){
			X = X - variation[j];
			count++;
		} j=0; j=0 j 0 j<N j N j++ j++ j {
			X = X - variation[j];
			count++;
		} {
			X = X - variation[j];
			count++;
		} X = X - variation[j] X X - variation[j] X variation[j] variation j count++ count for(k=0;k<N;k++){
			max[k]=X/variation[k];
		} k=0; k=0 k 0 k<N k N k++ k++ k {
			max[k]=X/variation[k];
		} {
			max[k]=X/variation[k];
		} max[k]=X/variation[k] max[k] max k X/variation[k] X variation[k] variation k for(j=0;j<N;j++){
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		} j=0; j=0 j 0 j<N j N j++ j++ j {
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		} {
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		} for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			} k=j+1; k=j+1 k j+1 j 1 k<N k N k++ k++ k {
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			} {
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			} if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				} max[k]>max[j] max[k] max k max[j] max j {
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				} int t = max[k]; t max[k] max k max[k] = max[j] max[k] max k max[j] max j max[j] = t max[j] max j t count = count + max[0] count count + max[0] count max[0] max 0 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[] variation = new int[N];
		int count = 0;
		int i,j,k =0;
		int[] max = new int[N];
		
		for(i=0;i<N;i++){
			variation[i] = sc.nextInt();
		}
		
		for(j=0;j<N;j++){
			X = X - variation[j];
			count++;
		}
		
		for(k=0;k<N;k++){
			max[k]=X/variation[k];
		}
		
		for(j=0;j<N;j++){
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		}
		
		count = count + max[0];
		
		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[] variation = new int[N];
		int count = 0;
		int i,j,k =0;
		int[] max = new int[N];
		
		for(i=0;i<N;i++){
			variation[i] = sc.nextInt();
		}
		
		for(j=0;j<N;j++){
			X = X - variation[j];
			count++;
		}
		
		for(k=0;k<N;k++){
			max[k]=X/variation[k];
		}
		
		for(j=0;j<N;j++){
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		}
		
		count = count + max[0];
		
		System.out.println(count);
	}
} 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[] variation = new int[N];
		int count = 0;
		int i,j,k =0;
		int[] max = new int[N];
		
		for(i=0;i<N;i++){
			variation[i] = sc.nextInt();
		}
		
		for(j=0;j<N;j++){
			X = X - variation[j];
			count++;
		}
		
		for(k=0;k<N;k++){
			max[k]=X/variation[k];
		}
		
		for(j=0;j<N;j++){
			for(k=j+1;k<N;k++){
				if(max[k]>max[j]){
					int t = max[k];
					max[k] = max[j];
					max[j] = t;
				}
			}
		}
		
		count = count + max[0];
		
		System.out.println(count);
	}
}