import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		BitterAlchemy solver = new BitterAlchemy();
		solver.readInput();
		solver.solve();
		solver.writeOutput();
	}


	static class BitterAlchemy {

		private Scanner scanner;
		private int n;
		private int x;
		private int[] m;
		private int output;

		public BitterAlchemy(){
			scanner = new Scanner(System.in);
		}

		public void readInput() {
			n = scanner.nextInt();
			x = scanner.nextInt();
			m = new int[n];
			for(int i=0; i<n;i++) {
				m[i] = scanner.nextInt();
			}
		}
		public void solve() {
			int min = 1000;
			output=0;
			for(int i=0;i<n;i++) {
				x -= m[i];
				output++;
				if(m[i] < min) {
					min = m[i];
				}
			}

			while(min<=x) {
				x-=min;
				output++;
			}
		}
		public void writeOutput() {
			System.out.println(output);
		}

	}


}

/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