import java.util.Scanner;
import java.util.Arrays;
import java.util.Collections;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int givenNumber = scanner.nextInt();
        int quantity = scanner.nextInt();
        Integer[] cakes = new Integer[givenNumber];
        int sumCakesQuantity = 0;
        for(int i=0; i<givenNumber; i++) {
            cakes[i] = scanner.nextInt();
            sumCakesQuantity += cakes[i];
        }

        int quantityLeft = quantity - sumCakesQuantity;
        int maxCakes = 0;
        if(quantityLeft > 0) {
            maxCakes = quantityLeft / Collections.min(Arrays.asList(cakes));;
        }
        System.out.println(givenNumber + maxCakes);
    }
}

/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