#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
struct range{int l,r;};
bool operator <(const range&a,const range&b){return a.l<b.l;}
typedef vector<range> arr;
int n,s,cnt[N];arr dp[N*2+5];long long ans;
void merge(arr u,int d,arr&v){
    if(!u.size())return;
    for(range&x:u)x.l+=d,x.r+=d;arr z(u.size()+v.size());
    merge(u.begin(),u.end(),v.begin(),v.end(),z.begin());v.clear();
    int L=z[0].l,R=z[0].r;
    for(int i=1;i<z.size();i++){
        if(z[i].l<=R+1)R=max(R,z[i].r);
        else v.push_back({L,R}),L=z[i].l,R=z[i].r;
    }
    v.push_back({L,R});
}
int main(){
    // freopen("skew.in","r",stdin);
    // freopen("skew.out","w",stdout);
    scanf("%d%d",&n,&s);
    dp[N].push_back({0,0});
    for(int i=1,x;i<=n;i++)scanf("%d",&x),++cnt[x];
    for(int i=0;i<=n;i++)if(cnt[i]){
        auto trans=[&](int d){
            int k=d*(i-1),l=d*i;
            if(k<=0)for(int j=-N;j<=N+k;j++)merge(dp[N+j-k],l,dp[N+j]);
            else for(int j=N;j>=-N+k;j--)merge(dp[N+j-k],l,dp[N+j]);
        };
        for(int d=1;d<=cnt[i];cnt[i]-=d,d<<=1)trans(d);
        if(cnt[i])trans(cnt[i]);
    }
    for(int i=-N;i<=N;i++)
        for(range x:dp[N+i])ans+=x.r-x.l+1;
    printf("%lld\n",ans);
    return 0;
}