#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second

#define modPrepare() \
void Add(int &x,int y){(x+=y)>=Mod?x-=Mod:x;}\
void Del(int &x,int y){(x-=y)<0?x+=Mod:x;}\
int Pow(int a,int b){\
	int res=1;\
	while(b){\
		if(b&1) res=1ll*res*a%Mod;\
		a=1ll*a*a%Mod,b>>=1;\
	}\
	return res;\
}

#define facPrepare(_) \
const int len=_;\
int Fac[len+10],Iac[len+10]; \
void facInit(){\
	Fac[0]=Iac[0]=1;\
	for(int i=1;i<=len;++i) Fac[i]=1ll*Fac[i-1]*i%Mod;\
	Iac[len]=Pow(Fac[len],Mod-2);\
	for(int i=len-1;i;--i) Iac[i]=1ll*Iac[i+1]*(i+1)%Mod;\
}\
int Binom(int x,int y){return x<y?0:1ll*Fac[x]*Iac[y]%Mod*Iac[x-y]%Mod;}

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int,int> pii;

void read(int& x){
    static char c;int f=0;
    while(!isdigit(c=getchar()))
        if(c=='-') f=1;
    x=c^48;
    while(isdigit(c=getchar())) x=(x*10)+(c^48);
    if(f) x=-x;
}
void read(ll& x){
    static char c;int f=0;
    while(!isdigit(c=getchar()))
    	if(c=='-') f=1;
    x=c^48;
    while(isdigit(c=getchar())) x=(x*10)+(c^48);
    if(f) x=-x;
}
void read(uint& x){
    static char c;
    while(!isdigit(c=getchar()));x=c^48;
    while(isdigit(c=getchar())) x=(x*10)+(c^48);
}
void read(ull& x){
    static char c;
    while(!isdigit(c=getchar()));x=c^48;
    while(isdigit(c=getchar())) x=(x*10)+(c^48);
}
void chkmax(int& x,int y){if(y>x)x=y;}
void chkmin(int& x,int y){if(y<x)x=y;}
void chkmax(ll& x,ll y){if(y>x)x=y;}
void chkmin(ll& x,ll y){if(y<x)x=y;}
void chkmax(uint& x,uint y){if(y>x)x=y;}
void chkmin(uint& x,uint y){if(y<x)x=y;}
void chkmax(ull& x,ull y){if(y>x)x=y;}
void chkmin(ull& x,ull y){if(y<x)x=y;}

const int N=5e5+10;

int X,n;
ll A[N],S[N];

int sta[N],R[N],D[N],top;

int _lg[N];
ll st[N][21];
void Init(){
	memset(st,-0x3f,sizeof st);
	for(int i=2;i<=n;++i) _lg[i]=_lg[i>>1]+1;
	for(int i=1;i<=n;++i) st[i][0]=S[i];
	for(int B=1;B<=20;++B)
		for(int i=1;i+(1<<B)-1<=n;++i)
			st[i][B]=min(st[i][B-1],st[i+(1<<B-1)][B-1]);
}
ll Ask(int l,int r){
	int k=_lg[r-l+1];
	return min(st[l][k],st[r-(1<<k)+1][k]);
}

void Work(){
	read(X),read(n);
	for(int i=1;i<=n;++i) read(A[i]);
	for(int i=1;i<=n;++i) S[i]=S[i-1]+A[i];
	Init();
	sta[++top]=0;
	for(int i=0;i<=n;++i) R[i]=n+1;
	for(int i=1;i<=n;++i){
		while(top&&S[i]<S[sta[top]]) R[sta[top--]]=i;
		sta[++top]=i;
	}
	ll tmp=0,Ans=0;
	for(int i=0;i<n;++i) tmp+=R[i]-i-1;
	Ans=tmp;
	for(int i=0;i<n;++i){
		int l=i+1,r=n,mid,res=n+1;
		while(l<=r){
			mid=(l+r)>>1;
			if(Ask(i+1,mid)+X<S[i]) res=mid,r=mid-1;
			else l=mid+1;
		}
		D[i]=res-R[i];
	}
	priority_queue<pii,vector<pii>,greater<pii>> Q;
	for(int p=1;p<=n;++p){
		Q.push({R[p-1],p-1}),tmp+=D[p-1];
		while(Q.size()){
			auto o=Q.top();
			if(o.fir>=p) break;
			Q.pop(),tmp-=D[o.sec];
		}
		chkmax(Ans,tmp);
	}
	printf("%lld\n",Ans);
}

int main(){Work();}