#include<bits/stdc++.h>

#define LL long long

#define LD long double

#define fi first

#define se second

#define mk make_pair

#define PLL pair<LL, LL>

#define PLI pair<LL, int>

#define PII pair<int, int>

#define SZ(x) ((int)x.size())

#define ull unsigned long long

using namespace std;

const int N = 2e5 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const double eps = 1e-;

const double PI = acos(-);

const int MN = ;

struct Matrix {

    LL a[MN][MN];

    Matrix() {

        memset(a, , sizeof(a));

    }

    void init() {

        for(int i = ; i < MN; i++)

            a[i][i] = ;

    }

    Matrix operator * (const Matrix &B) const {

        Matrix C;

        for(int i = ; i < MN; i++)

            for(int j = ; j < MN; j++)

                for(int k = ; k < MN; k++) {

                    C.a[i][j] += 1.0 * a[i][k] * B.a[k][j] <= 2e18 ? a[i][k] * B.a[k][j] : INF;

                    C.a[i][j] = min(C.a[i][j], INF);

                }

        return C;

    }

    Matrix operator ^ (LL b) {

        Matrix C; C.init();

        Matrix A = (*this);

        while(b) {

            if(b & ) C = C * A;

            A = A * A; b >>= ;

        }

        return C;

    }

};

int n;

LL k;

LL a[N], b[N];

Matrix mat;

int Mat[][] = {

    {, , },

    {, , },

    {, , }

};

int main() {

    for(int i = ; i < ; i++)

        for(int j = ; j < ; j++)

            mat.a[i][j] = Mat[i][j];

    scanf("%d%lld", &n, &k);

    for(int i = ; i < n; i++) scanf("%d", &a[i]);

    int m = n; n = ;

    for(int i = , flag = ; i < m; i++) {

        if(a[i]) flag = ;

        if(flag) a[n++] = a[i];

    }

    LL mx = ;

    for(int i = ; i < n; i++) mx = max(mx, a[i]);

    if(mx >= k) {

        puts("");

        return ;

    }

    if(n >= ) {

        for(int o = ; o <=  && mx < k; o++) {

            LL prefix = ;

            for(int i = ; i < n && mx < k; i++) b[i] = i ? b[i - ] + a[i] : a[i];

            for(int i = ; i < n && mx < k; i++) a[i] = b[i], mx = max(mx, a[i]);

            if(mx >= k) {

                printf("%d\n", o);

                return ;

            }

        }

    } else {

        for(int i = n - ; i >= ; i--) a[ - (n - i)] = a[i];

        for(int i = ; i < ( - n); i++) a[i] = ;

        LL low = , high = (LL)1e18, ans = high;

        while(low <= high) {

            LL mid = (low + high) >> ;

            Matrix tmp = mat ^ mid;

            LL val = ;

            for(int i = ; i < ; i++) {

                val += 1.0 * a[i] * tmp.a[][i] <= 2e18 ? a[i] * tmp.a[][i] : INF;

                val = min(val, INF);

            }

            if(val >= k) high = mid - , ans = mid;

            else low = mid + ;

        }

        printf("%lld\n", ans);

    }

    return ;

}

/*

*/