#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) (int)((x).size())
//#define int ll
//#define N
using namespace std;
const int N=400005;
int n,m;
int cnt[N],a[N],s[N];
poly dp[N],dp1[N];
void move(poly &x,int y)
{
	for (auto &u:x)
		u+=y;
}
poly calc(poly &x,poly &y)
{
	poly res;
	// cout<<"calc "<<sz(x)<<" "<<sz(y)<<endl;
	int i=0,j=0;
	while (i<sz(x)||j<sz(y))
	{
		if (i<sz(x)&&(j==sz(y)||x[i]<y[j]))
		{
			int now=x[i];
			if (now>=0)
			{
				while (res.size()>1&&res[sz(res)-2]+cnt[1]>=now-1) res.pop_back();
				if (res.empty()||res.back()!=now) res.push_back(now);
			}
			i++;
		} else
		{
			int now=y[j];
			if (now>=0)
			{
				while (res.size()>1&&res[sz(res)-2]+cnt[1]>=now-1) res.pop_back();
				if (res.empty()||res.back()!=now) res.push_back(now);
			}
			j++;
		}
	}
	// cout<<"calc "<<sz(x)<<" "<<sz(y)<<endl;
	return res;
}
void BellaKira()
{
    cin>>n>>m;
    for (int i=1;i<=n;i++)
	{
        cin>>a[i];
		// a[i]=(i>=n/2);
	}
    dp[0 +n].push_back(0);
    for (int i=1;i<=n;i++)
    	cnt[a[i]]++;
    for (int i=1;i<=cnt[0];i++)
    {
    	while (dp[-i+n].size()>1&&dp[-i+n][sz(dp[-i+n])-2]+cnt[1]>=i-1) dp[-i+n].pop_back();
    	dp[-i +n].push_back(i);
    }
    // return;
    for (int i=2;i<=m;i++)
    	if (cnt[i])
    	{
    		int d=i-1;
    		int lim=d*cnt[i];
    		for (int st=-n;st<=m;st++)
    			if (st-d<-n)
    			{
    				int l=st;
    				//x means [l,mid-d] y means [mid,r]
    				vector<poly>x;
					poly y;
					y=dp[st+n];
					int r=st;
    				for (int j=st+d;j<=m;j+=d)
    				{
						move(y,1);
						y=calc(y,dp[j+n]);
    					if (j-lim>l)
    					{
    						l+=d;
    						if (x.size()) x.pop_back();
    						else
    						{
    							for (int k=j;k>=l;k-=d)
    							{
									poly now;
									now=dp[k+n];
									move(now,(j-k)/d);
    								if (x.empty()) x.push_back(now);
									else
										x.push_back(calc(x.back(),now));
	    						}
								r=j;
								y=poly();
	    					}
	    				}
						if (x.empty()) dp1[j+n]=y;
						else
						{
							dp1[j+n]=x.back();
							move(dp1[j+n],(j-r)/d);
	    					dp1[j+n]=calc(dp1[j+n],y);
						}
    				}
    				for (int j=st+d;j<=m;j+=d) dp[j+n].swap(dp1[j+n]);
    			}
    	}
    ll ans=0;
    for (int i=-n;i<=m;i++)
    {
    	poly now=dp[i+n];
    	if (now.empty()) continue;
    	ans+=cnt[1]+1;
    	for (int j=1;j<sz(now);j++)
    		ans+=cnt[1]+1-max(0,now[j-1]+cnt[1]-now[j]+1);
    }
    cout<<ans<<'\n';
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}