#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::push(T &l, T &r)  should push the lazy update.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreeRange {
  int logN, n;
  vector<T> ts;
  SegmentTreeRange() {}
  explicit SegmentTreeRange(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreeRange(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void push(int u) {
    ts[u].push(ts[u << 1], ts[u << 1 | 1]);
  }
  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Applies T::f(args...) to [a, b).
  template <class F, class... Args>
  void ch(int a, int b, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return;
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) (ts[aa++].*f)(args...);
      if (bb & 1) (ts[--bb].*f)(args...);
    }
    for (int h = 1; h <= logN; ++h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) pull(aa);
      } else {
        if ((aa << h) != a) pull(aa);
        if ((bb << h) != b) pull(bb);
      }
    }
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (int h = logN; h; --h) push(a >> h);
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          push(a);
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (int h = logN; h; --h) push((b - 1) >> h);
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          push(b - 1);
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////


constexpr int INF = 1001001001;
struct NodeMinLen {
  int mn, lz;
  Int len;
  NodeMinLen() : mn(INF), lz(0), len(0) {}
  void push(NodeMinLen &l, NodeMinLen &r) {
    if (lz != 0) {
      l.add(lz);
      r.add(lz);
      lz = 0;
    }
  }
  void pull(const NodeMinLen &l, const NodeMinLen &r) {
    if (l.mn < r.mn) {
      mn = l.mn;
      len = l.len;
    } else if (l.mn > r.mn) {
      mn = r.mn;
      len = r.len;
    } else {
      mn = l.mn;
      len = l.len + r.len;
    }
  }
  void add(int val) {
    mn += val;
    lz += val;
  }
};

struct RectUnionArea {
  struct Rect {
    Int x0, x1, y0, y1;
  };
  vector<Rect> rects;
  void add(Int x0, Int x1, Int y0, Int y1) {
    assert(x0 <= x1); assert(y0 <= y1);
    rects.push_back(Rect{x0, x1, y0, y1});
  }
  Int run() {
    const int rectsLen = rects.size();
    if (rectsLen == 0) return 0;
    vector<Int> ys(rectsLen << 1);
    for (int i = 0; i < rectsLen; ++i) {
      ys[i << 1    ] = rects[i].y0;
      ys[i << 1 | 1] = rects[i].y1;
    }
    sort(ys.begin(), ys.end());
    ys.erase(unique(ys.begin(), ys.end()), ys.end());
    const int ysLen = ys.size();
    vector<pair<Int, pair<pair<int, int>, int>>> events(rectsLen << 1);
    for (int i = 0; i < rectsLen; ++i) {
      const int pos0 = lower_bound(ys.begin(), ys.end(), rects[i].y0) - ys.begin();
      const int pos1 = lower_bound(ys.begin(), ys.end(), rects[i].y1) - ys.begin();
      events[i << 1    ] = make_pair(rects[i].x0, make_pair(make_pair(pos0, pos1), +1));
      events[i << 1 | 1] = make_pair(rects[i].x1, make_pair(make_pair(pos0, pos1), -1));
    }
    sort(events.begin(), events.end());
    SegmentTreeRange<NodeMinLen> seg(ysLen - 1);
    for (int i = 0; i < ysLen - 1; ++i) {
      seg.at(i).mn = 0;
      seg.at(i).len = ys[i + 1] - ys[i];
    }
    seg.build();
    const Int yAll = ys[ysLen - 1] - ys[0];
    Int area = 0;
    for (int i = 0; i < (rectsLen << 1) - 1; ++i) {
      seg.ch(events[i].second.first.first, events[i].second.first.second, &NodeMinLen::add, events[i].second.second);
      area += (events[i + 1].first - events[i].first) * (yAll - ((seg.ts[1].mn == 0) ? seg.ts[1].len : 0));
    }
    return area;
  }
};


/*
  y: # of 0
  z: # of 1
  w: # of >= 2
  
  z >= S/5
  S <= 5 z
  
  S >= z + 2 w
  w <= (1/2) (S - z) <= 2 z
  
  (sum - sz) -> interval of sz
  (interval len) >= z
  sz = z + w <= 3 z
  ==> (<= 2) disjoint intervals
  
  2 disjoint intervals:

37 77
21 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

*/

struct State {
  int len;
  int ls[2], rs[2];
  State() : len(0), ls{-1, -1}, rs{-1, -1} {}
  friend ostream &operator<<(ostream &os, const State &s) {
    return os << "(" << s.len << ",[" << s.ls[0] << "," << s.rs[0] << "),[" << s.ls[1] << "," << s.rs[1] << "))";
  }
  void add(int l, int r) {
    if (len == 0) {
      len = 1;
      ls[0] = l;
      rs[0] = r;
    } else if (len == 1) {
      if (r < ls[0]) {
        len = 2;
        ls[1] = ls[0];
        rs[1] = rs[0];
        ls[0] = l;
        rs[0] = r;
      } else if (rs[0] < l) {
        len = 2;
        ls[1] = l;
        rs[1] = r;
      } else {
        chmin(ls[0], l);
        chmax(rs[0], r);
      }
    } else {
      if (r < ls[1]) {
        chmin(ls[0], l);
        chmax(rs[0], r);
      } else if (rs[0] < l) {
        chmin(ls[1], l);
        chmax(rs[1], r);
      } else {
        len = 1;
        chmin(ls[0], l);
        chmax(rs[0], r);
        chmin(ls[0], ls[1]);
        chmax(rs[0], rs[1]);
      }
    }
  }
};

int N, S;
vector<int> A;

int main() {
  for (; ~scanf("%d%d", &N, &S); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    sort(A.begin(), A.end());
    
    const int Y = lower_bound(A.begin(), A.end(), 1) - A.begin();
    const int Z = (lower_bound(A.begin(), A.end(), 2) - A.begin()) - Y;
    const int W = N - Y - Z;
// cerr<<"A = "<<A<<", Y = "<<Y<<", Z = "<<Z<<", W = "<<W<<endl;
    assert(W <= 2 * Z);
    
    const int lim = S - (Z + W) + 1;
    vector<State> dp(lim);
    dp[0].add(0, Z + 1);
    for (int i = Y + Z, j; i < N; i = j) {
      for (j = i; j < N && A[i] == A[j]; ++j) {}
      int lot = j - i;
      for (int e = 0; lot > 0; ++e) {
        const int t = min(1 << e, lot);
        lot -= t;
        const int dx = t * (A[i] - 1);
        for (int x = lim - dx; --x >= 0; ) {
          for (int k = 0; k < dp[x].len; ++k) {
            dp[x + dx].add(dp[x].ls[k] + t, dp[x].rs[k] + t);
          }
        }
      }
    }
// for(int x=0;x<lim;++x)if(dp[x].len)cerr<<"dp["<<x<<"] = "<<dp[x]<<endl;
    
    RectUnionArea f;
    for (int x = 0; x < lim; ++x) {
      for (int k = 0; k < dp[x].len; ++k) {
        const int l = dp[x].ls[k] + x;
        const int r = dp[x].rs[k] + x;
        f.add(x, x + Y + 1, l, r);
      }
    }
    const Int ans = f.run();
    printf("%lld\n", ans);
  }
  return 0;
}