#include <bits/stdc++.h>
using namespace std;

using ci = const int;
using pii = pair<int, int>;

using u32 = uint32_t;
using i64 =  int64_t;
using u64 = uint64_t;

template<class T> inline void Max(T &x, const T &y) { if (x < y) x = y; }
template<class T> inline void Min(T &x, const T &y) { if (y < x) x = y; }

const int N = 2e5 + 5;

struct Line {
	int l, r;
};

i64 ans;
int n, S, cnt[N];
vector<pair<int, int>> dk;
vector<Line> dp[N << 1];

void mg(vector<Line> &x, vector<Line> y, int z) {
	if (y.empty()) return;
	for (auto &o : y) o.l += z, o.r += z;
	if (x.empty()) return swap(x, y);
	vector<Line> ls;
	vector<Line>::iterator i1 = x.begin(), i2 = y.begin(), i;
	int L, R;
	if (i1->l < i2->l) L = i1->l, R = i1->r, ++i1;
	else L = i2->l, R = i2->r, ++i2;
	while (i1 != x.end() or i2 != y.end()) {
		if (i1 == x.end()) i = i2++;
		else if (i2 == y.end()) i = i1++;
		else i = i1->l < i2->l ? i1++ : i2++;
		if (R + 1 < i->l) ls.push_back({ L, R }), L = i->l;
		Max(R, i->r);
	}
	ls.push_back({ L, R });
	x = ls;
}

int main() {
#ifndef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif

	scanf("%d %d", &n, &S);
	for (int i = 1, x; i <= n; ++i) {
		scanf("%d", &x);
		++cnt[x];
	}

	for (int i = 2; i <= n; ++i) {
		for (int &j = cnt[i], k = 1; j > k; j -= k, k <<= 1) dk.push_back({ k, k * (i - 1) });
		if (cnt[i]) dk.push_back({ cnt[i], (i - 1) * cnt[i] });
	}

	for (int i = 0; i <= cnt[0]; ++i) dp[N - i].push_back({ i, i + cnt[1] });

	int ed = N;
	for (const auto &x : dk) {
		for (int i = ed; i >= N - cnt[0]; --i)
			mg(dp[i + x.second], dp[i], x.first);
		ed += x.second;
	}

	for (int i = N - cnt[0]; i <= ed; ++i)
		for (const auto &x : dp[i]) ans += x.r - x.l + 1;
	printf("%lld", ans);

	return 0;
}