#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cassert>
#define N 400000
#define inf 1e9
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int n,S,cnt,cnt2,a[N+1],cnts[N+1];
long long ans;
vector<int>dp[N+1];
vector<int>A[N+1];
vector<int>B[N+1];
vector<int>c;
vector<int>d;
vector<int>operator + (vector<int>a,vector<int>b)
{
    int ps=-1;
    c.clear(),d.clear();
    for (int i=0;i<b.size();++i)
    {
	while (ps+1<a.size()&&a[ps+1]<b[i]) c.push_back(a[++ps]);
	c.push_back(b[i]);
    }
    for (int i=ps+1;i<a.size();++i) c.push_back(a[i]);
    for (int i=0;i<c.size();++i)
    {
	while (!d.empty()&&d.back()==c[i]) d.pop_back();
	while (d.size()>=2&&c[i]-d[(int)(d.size())-2]<=cnt2) d.pop_back();
	d.push_back(c[i]);
    }
    return d;
}
vector<int>operator + (vector<int>p,int d)
{
    for (int i=0;i<p.size();++i) p[i]+=d;
    return p;
}
vector<int>operator - (vector<int>p,int d)
{
    for (int i=0;i<p.size();++i) p[i]-=d;
    return p;
}
int main()
{
    int d,sr;
    n=read(),S=read(),S=0;
    for (int i=1;i<=n;++i)
    {
	a[i]=read()-1;
	if (a[i]==-1) cnt++;
	if (a[i]==0) cnt2++;
	if (a[i]>=1) cnts[a[i]]++;
	S+=max(a[i],0);
    }
    for (int i=0;i<=cnt;++i) dp[i].push_back(cnt-i);
    for (int i=1;i<=S;++i)
	if (cnts[i])
	{
	    for (int j=0;j<i;++j)
	    {
		d=(S+cnt-j)/i;
		for (int k=0;k<=d;++k)
		{
		    if (!k||k/cnts[i]!=(k-1)/cnts[i]) A[k]=dp[k*i+j]-k;
		    else A[k]=A[k-1]+(dp[k*i+j]-k);
		}
		for (int k=d;k>=0;--k)
		{
		    if (k==d||k/cnts[i]!=(k+1)/cnts[i]) B[k]=dp[k*i+j]-k;
		    else B[k]=B[k+1]+(dp[k*i+j]-k);
		}
		for (int k=0;k<=d;++k)
		{
		    dp[k*i+j]=A[k]+k;
		    if (k>=cnts[i]) dp[k*i+j]=dp[k*i+j]+(B[k-cnts[i]]+k);
		}
	    }
	}
    for (int i=0;i<=S+cnt;++i)
    {
	sr=-inf;
	for (int j=0;j<dp[i].size();++j) ans+=dp[i][j]+cnt2-max(dp[i][j],sr+1)+1,sr=dp[i][j]+cnt2;
    }
    printf("%lld\n",ans);
    return 0;
}