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);
    }
} import java.lang.reflect.Array; Array java.lang.reflect import java.util.*; util.* java import java.lang.*; lang.* java 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);
    }
} 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);
    } main {
        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);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int x = sc.nextInt(); x sc.nextInt() sc.nextInt sc int m[] = new int[n]; m new int[n] n for (int i = 0; i < n; i++) {
            m[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            m[i] = sc.nextInt();
        } {
            m[i] = sc.nextInt();
        } m[i] = sc.nextInt() m[i] m i sc.nextInt() sc.nextInt sc Arrays.sort(m) Arrays.sort Arrays m int sum[] = new int[n]; sum new int[n] n sum[0] = m[0] sum[0] sum 0 m[0] m 0 for (int i = 1; i < n; i++) {
            sum[i] = sum[i - 1] + m[i];
        } int i = 1; int i = 1; i 1 i < n i n i++ i++ i {
            sum[i] = sum[i - 1] + m[i];
        } {
            sum[i] = sum[i - 1] + m[i];
        } sum[i] = sum[i - 1] + m[i] sum[i] sum i sum[i - 1] + m[i] sum[i - 1] sum i - 1 i 1 m[i] m i int dounut = 0; 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;
                }
            }
        } x >= sum[n - 1] x sum[n - 1] sum n - 1 n 1 {
            dounut = n + (x - sum[n - 1]) / sum[0];
        } dounut = n + (x - sum[n - 1]) / sum[0] dounut n + (x - sum[n - 1]) / sum[0] n (x - sum[n - 1]) / sum[0] (x - sum[n - 1]) x sum[n - 1] sum n - 1 n 1 sum[0] sum 0 {
            for (int i = 0; i < n; i++) {
                if (m[i] > x) {
                    dounut = i - 1;
                    break;
                }
            }
        } for (int i = 0; i < n; i++) {
                if (m[i] > x) {
                    dounut = i - 1;
                    break;
                }
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                if (m[i] > x) {
                    dounut = i - 1;
                    break;
                }
            } {
                if (m[i] > x) {
                    dounut = i - 1;
                    break;
                }
            } if (m[i] > x) {
                    dounut = i - 1;
                    break;
                } m[i] > x m[i] m i x {
                    dounut = i - 1;
                    break;
                } dounut = i - 1 dounut i - 1 i 1 break; System.out.println(dounut) System.out.println System.out System System.out dounut String[] args args 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);
    }
} 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);
    }
} Main
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);
    }
}