import java.util.Scanner;
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];
		int total = n;
		int remain = x;
		for(int i = 0; i < n; i++) {
			m[i] = sc.nextInt();
			remain-=m[i];
		}
		int greatest = 0;
		if(remain > 0) {
			for(int i = 0; i < n; i++) {
				if((remain-remain%m[i])/m[i] > greatest) {
					greatest = (remain-remain%m[i])/m[i];
				}
			}
		}
		total+=greatest;
		
		System.out.println(total);
	}
}
/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