#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;

using i32 = int;
using i64 = long long;
using u32 = unsigned int;
using u64 = unsigned long long;

template<typename T> using vec = vector<T>;

signed main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int n, s;
    cin >> n >> s;
    vec<int> cnt(s + 1);
    for (int i = 0, a; i < n; i++) {
        cin >> a;
        cnt[a]++;
    }
    int m = cnt[0];
    vec<vec<pair<int, int>>> dp(m + s + 1);
    vec<pair<int, pair<int, int>>> td;

    dp[m] = {{0, 1}};

    auto arrange = [](vec<pair<int, int>> v)
    {
        sort(v.begin(), v.end());
        // for (auto [l, r]: v) cout << "(" << l << ", " << r << "), ";
        // cout << endl;
        vec<pair<int, int>> res;
        res.reserve(5);
        res.emplace_back(v[0]);
        for (auto it = v.begin() + 1; it != v.end(); it++) {
            if (res.back().second >= it->first) {
                res.back().second = max(res.back().second, it->second);
            }
            else res.emplace_back(*it);
        }
        // for (auto [l, r]: res) cout << "(" << l << ", " << r << "), ";
        // cout << endl << endl;
        return res;
    };

    auto update = [&](int k, int c)
    {
        for (int i = 0; i <= s + m; i++) if (dp[i].size()) {
            dp[i] = arrange(std::move(dp[i]));
            int ed = dp[i].size();
            for (int j = 0; j < ed; j++) {
                auto [l, r] = dp[i][j];
                td.emplace_back(i + k * c - c, pair{l + c, r + c});
            }
        }
        for (auto [p, x]: td) {
            dp[p].emplace_back(x.first, x.second);
        }
        td.clear();
    };

    for (int i = 0; i <= s; i++) if (cnt[i] != 0) {
        int c = cnt[i];
        for (int p = 1; p <= c; p *= 2) {
            c -= p;
            update(i, p);
        }
        if (c) update(i, c);
    }

    i64 ans = 0;
    for (int i = 0; i <= s + m; i++) if (dp[i].size()) {
        dp[i] = arrange(std::move(dp[i]));
        for (auto [l, r]: dp[i]) ans += r - l;
    }
    cout << ans << endl;
    return 0;
}

/*
7 9
0 0 0 1 1 2 5

10 33
9 9 8 1 1 1 1 1 1 1

10 14
2 4 4 1 0 1 0 1 0 1

10 14
3 5 3 0 1 0 1 0 1 0
*/