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 Max = 0;
    int[] list = new int[N];
    for(int i = 0 ; i < N; i++){
      list[i] = sc.nextInt();
      Max += list[i];
    }
    
    if(Max <= X){
      int Min = list[0];
       for(int i = 0 ; i < N; i++){
            if(list[i] < Min){
              Min = list[i];
            }
       }
      int ans1 = X -Max;
      int ans2 = ans1 / Min;
      
      System.out.println(ans2 + N);  
      
    }else{
      System.out.println("ドーナツを全種類作ることは不可能です");  
    }
    
  }  
}
/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