import java.util.Arrays;
import java.util.Scanner;
 
public class Main {
    public static void main(String[] args) {
 
        Scanner in = new Scanner(System.in);
        int N = in.nextInt(); int X= in.nextInt();
 
        int[] cost = new int[N];
 
        for(int i = 0; i < N; i++){
            cost[i] = in.nextInt();
            X-=cost[i];
        }
 
 
        Arrays.sort(cost);
 
        int add = 0;
        while(X >= cost[0]) {
            add++;
            X-=cost[0];
        }
 
        System.out.println(N + add);
 
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz