import java.lang.reflect.Array;
import java.util.*;
import java.lang.*;

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];
        for (int i = 0; i < n; i++) {
            m[i] = sc.nextInt();
        }
        Arrays.sort(m);
        int sum[] = new int[n];
        sum[0] = m[0];
        for (int i = 1; i < n; i++) {
            sum[i] = sum[i - 1] + m[i];
        }

        int dounut = 0;
        if (x >= sum[n - 1]) {
            dounut = n + (x - sum[n - 1]) / sum[0];
        } else {
            for (int i = 0; i < n; i++) {
                if (m[i] > x) {
                    dounut = i - 1;
                    break;
                }
            }
        }
        System.out.println(dounut);
    }
}
/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