import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


// floor(a / b)
Int divFloor(Int)(Int a, Int b) {
  return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}

// ceil(a / b)
Int divCeil(Int)(Int a, Int b) {
  return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const L = readLong();
      auto W = new int[N];
      foreach (i; 0 .. N) {
        W[i] = readInt();
      }
      W.sort;
      
      const V = W[N - 1];
      DList!int que;
      auto vis = new bool[V];
      auto dist = new int[V];
      dist[] = V;
      dist[0] = 0;
      que ~= 0;
      for (; !que.empty; ) {
        const u = que.front;
        que.removeFront;
        if (!vis[u]) {
          vis[u] = true;
          const c = dist[u];
          foreach (i; 0 .. N - 1) {
            int cc = c;
            int v = u + W[i];
            if (v >= V) {
              cc += 1;
              v -= V;
            }
            if (chmin(dist[v], cc)) {
              if (cc == c) {
                que.insertFront(v);
              } else {
                que.insertBack(v);
              }
            }
          }
        }
      }
      debug {
        if (V <= 10) {
          writeln("dist = ", dist);
        }
      }
      
      long ans;
      foreach (u; 0 .. V) {
        if (dist[u] < V) {
          const lb = dist[u];
          const ub = divFloor(L - u, V);
          if (lb <= ub) {
            ans += (ub - lb + 1);
          }
        }
      }
      --ans;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}