#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long INF = mod * mod;
const long double eps = 1e-12;
const long double pi = acos(-1.0);
long long mod_pow(long long a, long long n, long long m) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * a % m;
    a = a * a % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint &a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint &a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
vector<long long> makenext(vector<long long> &a) {
  vector<long long> res;
  long long sum = 0;
  res.push_back(sum);
  for (int i = 0; i < a.size(); i++) {
    sum += a[i];
    if (sum > INF) sum = INF;
    res.push_back(sum);
  }
  return res;
}
int cnt(vector<long long> &a) {
  int res = 0;
  for (int i = 0; i < a.size(); i++)
    if (a[i] > 0) res++;
  return res;
}
long long mul(long long a, long long b) {
  if (a == 0) return 0;
  if (INF / a < b) return INF;
  return a * b;
}
vector<vector<long long>> mtmul(vector<vector<long long>> &A,
                                vector<vector<long long>> &B) {
  vector<vector<long long>> C(A.size(), vector<long long>(B[0].size()));
  for (int i = 0; i < (int)A.size(); i++) {
    for (int k = 0; k < (int)B.size(); k++) {
      for (int j = 0; j < (int)B[0].size(); j++) {
        C[i][j] += mul(A[i][k], B[k][j]);
        if (C[i][j] > INF) C[i][j] = INF;
      }
    }
  }
  return C;
}
vector<vector<long long>> mtpow(vector<vector<long long>> A, long long n) {
  vector<vector<long long>> B(A.size(), vector<long long>(A.size()));
  for (int i = 0; i < (int)A.size(); i++) {
    B[i][i] = 1;
  }
  while (n > 0) {
    if (n & (long long)1) B = mtmul(B, A);
    A = mtmul(A, A);
    n >>= 1;
  }
  return B;
}
void solve() {
  int n;
  cin >> n;
  long long k;
  cin >> k;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    if (a[i] >= k) {
      cout << 0 << endl;
      return;
    }
  }
  int ans = 1;
  a = makenext(a);
  for (int i = 0; i < a.size(); i++)
    if (a[i] >= k) {
      cout << 1 << endl;
      return;
    }
  int num = cnt(a);
  if (num >= 6) {
    while (true) {
      ans++;
      a = makenext(a);
      for (int i = 0; i < a.size(); i++)
        if (a[i] >= k) {
          cout << ans << endl;
          return;
        }
    }
  } else {
    vector<long long> las;
    for (int i = a.size() - 1; i >= 0; i--)
      if (a[i] > 0) las.push_back(a[i]);
    vector<vector<long long>> bs(num, vector<long long>(num, 0));
    for (int i = 0; i < num; i++)
      for (int j = 0; j < num; j++) {
        if (i <= j) bs[i][j] = 1;
      }
    long long le = -1, ri = INF;
    while (ri - le > 1) {
      long long mid = (le + ri) / 2;
      vector<vector<long long>> z = mtpow(bs, mid);
      vector<long long> res(num);
      for (int i = 0; i < num; i++) {
        for (int j = 0; j < num; j++) {
          res[i] += mul(z[i][j], las[j]);
          if (res[i] > INF) res[i] = INF;
        }
      }
      if (res[0] >= k)
        ri = mid;
      else
        le = mid;
    }
    cout << ans + ri << endl;
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  char nyaa;
  cin >> nyaa;
  return 0;
}
