#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];

int dp[N][5],dp1[N][5];
void move(int *x,int y)
{
	for (int i=0;i<5;i++)
		if (x[i]!=-1) x[i]+=y;
}
int tmp[25];
void calc(int *x,int *y)
{
	int i=0,j=0,k=0;
    for (int i=0;i<25;i++) tmp[i]=-1;
	while (i<5&&x[i]!=-1||j<5&&y[j]!=-1)
	{
		if (i<5&&x[i]!=-1&&(j>=5||y[j]==-1||x[i]<y[j]))
		{
			int now=x[i];
			if (now>=0)
			{
				while (k>1&&tmp[k-2]+cnt[1]>=now-1) k--;
				if (k==0||tmp[k-1]!=now) tmp[k++]=now;
			}
			i++;
		} else
		{
			int now=y[j];
			if (now>=0)
			{
				while (k>1&&tmp[k-2]+cnt[1]>=now-1) k--;
				if (k==0||tmp[k-1]!=now) tmp[k++]=now;
			}
            j++;
		}
	}
}

void BellaKira()
{
	memset(dp,-1,sizeof(dp));
    cin>>n>>m;
    for (int i=1;i<=n;i++)
        cin>>a[i];
	dp[0+n][0]=0;
    for (int i=1;i<=n;i++)
    	cnt[a[i]]++;
    {
        for (int i=1;i<=cnt[0];i++)
        {
            dp[-i+n][0]=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;
					static int y[5];
					for (int k=0;k<5;k++)
						y[k]=dp[st+n][k];
					int r=st;
    				for (int j=st+d;j<=m;j+=d)
    				{
                        move(y,1);
						calc(y,dp[j+n]);
						memcpy(y,tmp,sizeof(int)*5);
    					if (j-lim>l)
    					{
    						l+=d;
                            if (l>r)
    						{
    							for (int k=j;k>=l;k-=d)
    							{
									move(dp[k+n],(j-k)/d);
									if (k+d<=j)
									{
										calc(dp[k+n],dp[k+n+d]);
										memcpy(dp[k+n],tmp,sizeof(dp[k+n]));
									}
	    						}
								r=j;
								memset(y,-1,sizeof(y));
	    					}
	    				}
						if (x.empty()) 
						{
							memcpy(dp1[j+n],dp[l+n],sizeof(dp1[j+n]));
							move(dp1[j+n],(j-r)/d);
							
	    					calc(dp1[j+n],y);
							memcpy(dp1[j+n],tmp,sizeof(dp1[j+n]));
						}
    				}
    				for (int j=st+d;j<=m;j+=d) memcpy(dp[j+n],dp1[j+n],sizeof(dp[j+n]));
    			}
    	}
    ll ans=0;
    for (int i=-n;i<=m;i++)
    {
    	if (dp[i+n][0]==-1) continue;
    	ans+=cnt[1]+1;
    	for (int j=1;j<5;j++)
			if (dp[i+n][j]!=-1)
	    		ans+=cnt[1]+1-max(0,dp[i+n][j-1]+cnt[1]-dp[i+n][j]+1);
    }
    cout<<ans<<'\n';
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}