#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int n, S;
int a[200200], cnt[200200];
vector<pair<int, int>> dp[200200], dp2[200200];

struct DS{
	deque<pair<int, int>> minQ[6], maxQ[6], minGlobal;
	int curT, B;

	void init(int c){
		B = c;
		curT = -1e9;
	}

	void clear(){
		// printf("clear\n");
		minGlobal.clear();
		curT = -1e9;
		for (int i=0;i<6;i++){
			minQ[i].clear();
			maxQ[i].clear();
		}
	}

	void pop(int t){
		// printf("pop %d\n", t);
		curT = t+1;
	}

	void _push(int x, int t){
		// printf("_push %d %d\n", x, t);
		assert(x >= 0);
		int idx = x / B % 6;

		while(!minQ[idx].empty() && minQ[idx].back().first >= x) minQ[idx].pop_back();
		minQ[idx].emplace_back(x, t);

		while(!maxQ[idx].empty() && maxQ[idx].back().first <= x) maxQ[idx].pop_back();
		maxQ[idx].emplace_back(x, t);

		while(!minGlobal.empty() && minGlobal.back().first >= x) minGlobal.pop_back();
		minGlobal.emplace_back(x, t);
		// printf("ok\n");
	}

	void push(int l, int r, int t){
		// printf("push %d %d %d\n", l, r, t);
		l += n + S, r += n + S - B; // 닫힘으로 변환
		assert(l <= r);

		for (int i=l;i<r;i+=B) _push(i, t);
		_push(r, t);
		// printf("ok done\n");
	}

	vector<pair<int, int>> query(int ofs){
		vector<pair<int, int>> ret;

		while(!minGlobal.empty() && minGlobal.front().second < curT) minGlobal.pop_front();
		if (minGlobal.empty()) return ret;
		int s = minGlobal.front().first / B % 6;

		for (int idx=s;;){
			while(!minQ[idx].empty() && minQ[idx].front().second < curT) minQ[idx].pop_front();
			while(!maxQ[idx].empty() && maxQ[idx].front().second < curT) maxQ[idx].pop_front();

			if (minQ[idx].empty()){
				idx++;
				if (idx>=6) idx -= 6;
				if (idx==s) break;
				continue;	
			} 

			int mn = minQ[idx].front().first + ofs, mx = maxQ[idx].front().first + ofs;
			if (ret.empty() || ret.back().second < mn){
				ret.emplace_back(mn, mx+B);
			}

			else{
				ret.back().second = mx+B;
			}

			idx++;
			if (idx>=6) idx -= 6;
			if (idx==s) break;
		}

		return ret;
	}
}D;

void f(int x, int c){
	// printf("f: %d %d\n", x, c);
	for (int r=0;r<x-1;r++){
		D.clear();
		for (int i=r,j=0;i<=S;i+=x-1,j++){
			D.pop(j-c-1);
			
			for (auto &[l, r]:dp[i]){
				D.push(l-j, r-j, j);
			}

			dp[i] = D.query(j);
			// printf("dp[%d] = ", i);
			// for (auto &[l, r]:dp[i]) printf("(%d, %d) ", l, r);
			// printf("\n");
		}
	}
}

ll f0(int c){
	ll ret = 0;
	D.clear();

	for (int i=S;i>=-n;i--){
		D.pop(-i - (c+1));

		auto &C = (i>=0)?dp[i]:dp2[-i];
		for (auto &[l, r]:C){
			D.push(l+i, r+i, -i);
		}

		C = D.query(-i);
		for (auto &[l, r]:C) ret += r-l;
	}

	return ret;
}

int main(){
	scanf("%d %d", &n, &S);
	for (int i=1;i<=n;i++) scanf("%d", a+i);
	sort(a+1, a+n+1);

	for (int i=1;i<=n;i++) cnt[a[i]]++;

	D.init(cnt[1]);
	dp[0].emplace_back(0, cnt[1]+1);
	for (int i=2;i<=S;i++) if (cnt[i]) f(i, cnt[i]);
	printf("%lld\n", f0(cnt[0]));
}