#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int MxN=200002,MxV=MxN*2+20;
int n,s,s1=0,t,i0=0,i1=1,res=0;
LL ans=0;
int a[MxN],id[MxN],cnt[MxN];
typedef pair<int,int> P;
P p;
vector<P> tmp;
vector<P> vec[2][MxV];
template<class T>void read(T &x)
{
	x=0;int f=0;char ch=getchar();
	while(ch<'0' || ch>'9')f|=(ch=='-'),ch=getchar();
	while(ch>='0' && ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	x=f? -x:x;return ;
}
inline bool cmp(int x,int y)
{
	return cnt[x]*(x-res)<cnt[y]*(y-res);
}
inline void clear()
{
	for(int i=0;i<=s1;++i)vec[i1][i].clear();
}
inline vector<P> merge(vector<P> &A,vector<P> &B)
{
	if(!A.size())return B;
	if(!B.size())return A;
	vector<P> C;
	int tA=0,tB=0;
	P p;
	for(;tA<A.size() && tB<B.size();)
	{
		if(A[tA].first<B[tB].first)p=A[tA],++tA;
		else p=B[tB],++tB;
		f1:
		if(tA<A.size() && A[tA].first<=p.second)
		{
			p.second=max(p.second,A[tA].second),++tA;
			goto f1;
		}
		if(tB<B.size() && B[tB].first<=p.second)
		{
			p.second=max(p.second,B[tB].second),++tB;
			goto f1;
		}
		C.push_back(p);
	}
	for(;tA<A.size();)
	{
		p=A[tA],++tA;
		f2:
		if(tA<A.size() && A[tA].first<=p.second)
		{
			p.second=max(p.second,A[tA].second),++tA;
			goto f2;
		}
		C.push_back(p);
	}
	for(;tB<B.size();)
	{
		p=B[tB],++tB;
		f3:
		if(tB<B.size() && B[tB].first<=p.second)
		{
			p.second=max(p.second,B[tB].second),++tB;
			goto f3;
		}
		C.push_back(p);
	}
	return C;
}
inline void print()
{
	printf("vec:\n");
	for(int i=0;i<=s1;++i)if(vec[i0][i].size())
	{
		printf(" %d:",i);
		for(int j=0;j<vec[i0][i].size();++j)printf("(%d,%d)%c",vec[i0][i][j].first,vec[i0][i][j].second,j+1==vec[i0][i].size()? '\n':' ');
	}
}
inline void RSH(vector<P> &vec,int o)
{
	for(int i=0;i<vec.size();++i)vec[i].first+=o,vec[i].second+=o;
}
inline void solve1()
{
	int a=abs(p.first),b=p.second,sgn=(p.first<0? -1:1);
	//printf("a:%d b:%d sgn:%d\n",a,b,sgn);
	clear();
	if(sgn>0)s1+=a*b;
	for(int i=0;i<a;++i)
	{
		int tot=(s1-i)/a;
		for(int j=i;j<=s1;j+=a)
		{
			int x=j/a;
			RSH(vec[i0][j],-x*sgn);
		}
		for(int j=0;j<=tot;++j)
		{
			if(!(j%b))tmp=vec[i0][j*a+i];
			else tmp=merge(tmp,vec[i0][j*a+i]);
			if(sgn>0)vec[i1][j*a+i]=tmp;
			else if((j-b)*a+i>=0)vec[i1][(j-b)*a+i]=tmp;
		}
		if(sgn<0)for(int j=tot-b+1;j<=tot && j%b;++j)if(j*a+i>=0)vec[i1][j*a+i]=tmp;
		tmp.clear();
		for(int j=tot;j>=0;--j)
		{
			if(!((j+1)%b))tmp=vec[i0][j*a+i];
			else tmp=merge(tmp,vec[i0][j*a+i]);
			if(sgn>0)
			{
				if((j+b)*a+i<=s1)vec[i1][(j+b)*a+i]=merge(vec[i1][(j+b)*a+i],tmp);
			}
			else vec[i1][j*a+i]=merge(vec[i1][j*a+i],tmp);
		}
	}
	for(int i=0;i<=s1;++i)RSH(vec[i1][i],(i/a)*sgn);
	i0^=1,i1^=1;
}
inline void solve3()
{
	for(int i=s1;~i;--i)vec[i0][i+p.second]=vec[i0][i];
	for(int i=p.second-1;~i;--i)vec[i0][i].clear();
	s1+=p.second,solve1();
}
int main()
{
	//freopen("L.in","r",stdin);
	read(n),read(s);
	for(int i=1;i<=n;++i)read(a[i]),res+=(!a[i])-(a[i]==1),++cnt[a[i]];
	for(int i=0;i<=s;++i)id[i]=i;
	res=(res>=0? 0:1),sort(id,id+s+1,cmp),t=cnt[res],vec[0][0].push_back(P(0,t));
	for(int i=0;i<=s;++i)if(cnt[id[i]])
	{
		if(id[i]-res<=0)continue;
		p=P(id[i]-res,cnt[id[i]]),solve1();
	}
	if(id[0]-res<0)p=P(id[0]-res,cnt[id[0]]),solve3();
	for(int i=0;i<=s1;++i)for(int j=0;j<vec[i0][i].size();++j)ans+=vec[i0][i][j].second-vec[i0][i][j].first+1;
	return 0&printf("%lld",ans);
}