XXI Berland Annual Fair is coming really soon! Traditionally fair consists of n booths, arranged in a circle. The booths are numbered 1 through n clockwise with n being adjacent to 1. The i-th booths sells some candies for the price of a_i burles per item. Each booth has an unlimited supply of candies.

Polycarp has decided to spend at most T burles at the fair. However, he has some plan in mind for his path across the booths:

  * at first, he visits booth number 1; 
  * if he has enough burles to buy exactly one candy from the current booth, then he buys it immediately; 
  * then he proceeds to the next booth in the clockwise order (regardless of if he bought a candy or not). 



Polycarp's money is finite, thus the process will end once he can no longer buy candy at any booth.

Calculate the number of candies Polycarp will buy.

Input

The first line contains two integers n and T (1 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ T ≤ 10^{18}) — the number of booths at the fair and the initial amount of burles Polycarp has.

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — the price of the single candy at booth number i.

Output

Print a single integer — the total number of candies Polycarp will buy.

Examples

Input

3 38
5 2 5


Output

10


Input

5 21
2 4 100 2 6


Output

6

Note

Let's consider the first example. Here are Polycarp's moves until he runs out of money:

  1. Booth 1, buys candy for 5, T = 33; 
  2. Booth 2, buys candy for 2, T = 31; 
  3. Booth 3, buys candy for 5, T = 26; 
  4. Booth 1, buys candy for 5, T = 21; 
  5. Booth 2, buys candy for 2, T = 19; 
  6. Booth 3, buys candy for 5, T = 14; 
  7. Booth 1, buys candy for 5, T = 9; 
  8. Booth 2, buys candy for 2, T = 7; 
  9. Booth 3, buys candy for 5, T = 2; 
  10. Booth 1, buys no candy, not enough money; 
  11. Booth 2, buys candy for 2, T = 0. 



No candy can be bought later. The total number of candies bought is 10.

In the second example he has 1 burle left at the end of his path, no candy can be bought with this amount.
/**
 * BaZ :D
 */
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main
{
    static Reader scan;
    static PrintWriter pw;
    static long BIT[];
    static int n,BITcount[];
    public static void main(String[] args) {
        new Thread(null,null,"BaZ",1<<25)
        {
            public void run()
            {
                try
                {
                    solve();
                }
                catch(Exception e)
                {
                    e.printStackTrace();
                    System.exit(1);
                }
            }
        }.start();
    }
    static void solve() throws IOException
    {
        scan = new Reader();
        pw = new PrintWriter(System.out,true);
        StringBuilder sb = new StringBuilder();
        n = ni();
        long S = nl();
        BIT = new long[n+1];
        BITcount = new int[n+1];
        Pair arr[] = new Pair[n];
        Map<Integer, Long> map = new HashMap<>();
        for(int i=0;i<n;++i) {
            arr[i] = new Pair(ni(), i+1);
            map.put(i+1, (long)arr[i].x);
            update_count(i+1, 1);
            update(i+1, arr[i].x);
        }
        long ans = 0;
        int curr_start = 0;
        while(true) {
            long cnt = query_count(n);
            if(cnt==0) {
                break;
            }
            if(curr_start==0) {
                long abhi_sbka_sum = query(n);
                if(abhi_sbka_sum<=S) {
                    ans+=cnt * (S/abhi_sbka_sum);
                    S%=abhi_sbka_sum;
                }
                else {
                    int low = 0, high = n, mid;
                    while(low<high) {
                        mid = (low+high)>>1;
                        if(query(mid)<=S) {
                            if(mid==n || query(mid+1)>S) {
                                low = mid;
                                break;
                            }
                            else low = ++mid;
                        }
                        else high = --mid;
                    }
                    if(query(low)<=S) {
                        ans+=query_count(low);
                        S-=query(low);
                        update(low+1, -map.get(low+1));
                        update_count(low+1, -1);
                        if(low+1==n) {
                            curr_start = 0;
                        }
                        else curr_start = low+1;
                    }
                    else {
                        update(curr_start+1, -map.get(curr_start+1));
                        update_count(curr_start+1, -1);
                        curr_start++;
                    }
                }
            }
            else {
                if(query(n) - query(curr_start)<=S) {
                    ans+=query_count(n) - query_count(curr_start);
                    S-=query(n) - query(curr_start);
                    curr_start = 0;
                }
                else {
                    int low = curr_start +1, high = n, mid;
                    long ff = query(curr_start);
                    while(low<high) {
                        mid = (low+high)>>1;
                        if(query(mid) - ff <=S) {
                            if(mid==n || query(mid+1) - ff>S) {
                                low = mid;
                                break;
                            }
                            else low = ++mid;
                        }
                        else high = --mid;
                    }
                    if(query(low) - ff<=S) {
                        S-=query(low)-ff;
                        ans+=query_count(low) - query_count(curr_start);
                        update(low+1, -map.get(low+1));
                        update_count(low+1, -1);
                        if(low+1==n) {
                            curr_start = 0;
                        }
                        else curr_start = low+1;
                    }
                    else {
                        update(curr_start+1, -map.get(curr_start+1));
                        update_count(curr_start+1, -1);
                        if(curr_start+1==n) {
                            curr_start = 0;
                        }
                        else curr_start++;
                    }
                }
            }
        }
        pl(ans);
        pw.flush();
        pw.close();
    }
    static void update(int index,long val)
    {
        for(int i=index;i<=n;i+=i&-i)
            BIT[i]+=val;
    }
    static long query(int index)
    {
        long sum = 0;
        for(int i=index;i>0;i-=i&-i)
            sum+=BIT[i];
        return sum;
    }
    static void update_count(int index,int val)
    {
        for(int i=index;i<=n;i+=i&-i)
            BITcount[i]+=val;
    }
    static int query_count(int index)
    {
        int sum = 0;
        for(int i=index;i>0;i-=i&-i)
            sum+=BITcount[i];
        return sum;
    }
    static class Pair implements Comparable<Pair>
    {
        int x,y;
        Pair(int x,int y)
        {
            this.x=x;
            this.y=y;
        }
        public int compareTo(Pair other)
        {
            if(this.x!=other.x)
                return this.x-other.x;
            return this.y-other.y;
        }
        public String toString()
        {
            return "("+x+","+y+")";
        }
    }
    static int ni() throws IOException
    {
        return scan.nextInt();
    }
    static long nl() throws IOException
    {
        return scan.nextLong();
    }
    static double nd() throws IOException
    {
        return scan.nextDouble();
    }
    static void pl()
    {
        pw.println();
    }
    static void p(Object o)
    {
        pw.print(o+" ");
    }
    static void pl(Object o)
    {
        pw.println(o);
    }
    static void psb(StringBuilder sb)
    {
        pw.print(sb);
    }
    static void pa(String arrayName, Object arr[])
    {
        pl(arrayName+" : ");
        for(Object o : arr)
            p(o);
        pl();
    }
    static void pa(String arrayName, int arr[])
    {
        pl(arrayName+" : ");
        for(int o : arr)
            p(o);
        pl();
    }
    static void pa(String arrayName, long arr[])
    {
        pl(arrayName+" : ");
        for(long o : arr)
            p(o);
        pl();
    }
    static void pa(String arrayName, double arr[])
    {
        pl(arrayName+" : ");
        for(double o : arr)
            p(o);
        pl();
    }
    static void pa(String arrayName, char arr[])
    {
        pl(arrayName+" : ");
        for(char o : arr)
            p(o);
        pl();
    }
    static void pa(String listName, List list)
    {
        pl(listName+" : ");
        for(Object o : list)
            p(o);
        pl();
    }
    static void pa(String arrayName, Object[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(Object o : arr[i])
                p(o);
            pl();
        }
    }
    static void pa(String arrayName, int[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(int o : arr[i])
                p(o);
            pl();
        }
    }
    static void pa(String arrayName, long[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(long o : arr[i])
                p(o);
            pl();
        }
    }
    static void pa(String arrayName, char[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(char o : arr[i])
                p(o);
            pl();
        }
    }
    static void pa(String arrayName, double[][] arr) {
        pl(arrayName+" : ");
        for(int i=0;i<arr.length;++i) {
            for(double o : arr[i])
                p(o);
            pl();
        }
    }
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64];
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n') break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg) return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg) return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);
            if (neg) return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1) buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead) fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null) return;
            din.close();
        }
    }
}