
import java.util.Arrays;
import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int moto = sc.nextInt();
        int[] cake = new int[N];
        int ans = 0;
        
        
       for (int i = 0; i < N; i++) {
		cake[i] = sc.nextInt();
		if(moto >= cake[i]) {
		moto -= cake[i];
		ans++;
		}
		}
       
       sc.close();
       Arrays.sort(cake);
       
       while(moto >= cake[0]) {
    	   moto -= cake[0];
    	   ans++;
       }
       System.out.println(ans);
    }
}
/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