#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=200010,mod=998244353,inv2=(mod+1)/2;
int a[N],h[N],sl[N],sr[N],vis[N];
pair<int,ll>p[N];
ll dp[N],sum[N],v[N],w[N];
struct s{
	ll x;
	int id;
	bool operator<(s b)const{
		return abs(x)>abs(b.x);
	}
}tmp;
priority_queue<s>pq;
ll calc(pair<int,ll>a,ll x){
	return x*a.first+a.second;
}
void del(int x){
	vis[x]=1;
	sl[sr[x]]=sl[x];
	sr[sl[x]]=sr[x];
}
int main(){
	int n,ans=0,cnt=0,cntt=0,cnt1=0,cnt2=0;
	ll k,minn,now=-1e18,pl,pr,noww=0;
	scanf("%d",&n);
	minn=0;
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		sum[i]=sum[i-1]+a[i];
		now=max(now,sum[i]-minn);
		minn=min(minn,sum[i]);
	}
	scanf("%lld",&k);
	k++;
	now--;
	for(int i=1;i<=n;i++){
		if(a[i]>=0){
			cntt++;
			noww+=a[i];
		}
		else{
			h[++cnt1]=a[i];
		}
		if(i==1||(w[cnt]<0&&a[i]>0)||(w[cnt]>0&&a[i]<0)){
			w[++cnt]=a[i];
		}
		else{
			w[cnt]+=a[i];
		}
	}
	for(int i=1;i<=cnt;i++){
		if(w[i]>=0){
			cnt2++;
		}
	}
	for(int i=cnt2;i<=cntt;i++){
		dp[i]=noww;
	}
	sort(h+1,h+cnt1+1,greater<int>());
	for(int i=cntt+1;i<=n;i++){
		dp[i]=dp[i-1]+h[i-cntt];
	}
	for(int i=1;i<=cnt;i++){
		pq.push({w[i],i});
		sl[i]=i-1;
		sr[i]=i+1;
	}
	sr[cnt+1]=cnt+1;
	while(!pq.empty()&&cnt2>1){
		tmp=pq.top();
		pq.pop();
		if(vis[tmp.id]){
			continue;
		}
		if(w[tmp.id]>=0||(sl[tmp.id]>=1&&sr[tmp.id]<=cnt)){
			noww-=abs(w[tmp.id]);
			if(w[tmp.id]){
				cnt2--;
				dp[cnt2]=noww;
			}
			w[tmp.id]+=w[sl[tmp.id]]+w[sr[tmp.id]];
			pq.push({w[tmp.id],tmp.id});
			del(sl[tmp.id]);
			del(sr[tmp.id]);
		}
	}
	for(int i=cnt2-1;i>=1;i--){
		dp[i]=noww;
	}
	for(int i=1;i<=n;i++){
		v[n-i+2]=(dp[i]-dp[i-1]);
		p[n-i+1]={-i,dp[i]};
	}
	v[1]=-4e13;
	for(int i=1;i<=n;i++){
		if(i!=n&&calc(p[i],v[i+1])>=k){
			continue;
		}
		if(now<=v[i]){
			break;
		}
		if(i==1||calc(p[i],v[i])>k){
			ll l=v[i],r=v[i+1],mid,anss=0;
			while(l<=r){
				mid=(l+r)>>1;
				if(calc(p[i],mid)>k){
					l=mid+1;
				}
				else{
					anss=mid;
					r=mid-1;
				}
			}
			ans=(ans+(k-calc(p[i],anss))*(anss%mod))%mod;
			pl=anss+1;
		}
		else{
			pl=v[i]+1;
		}
		pr=min(v[i+1],now);
		if(pl>pr){
			continue;
		}
		ans=(ans+(pl+pr)%mod*((pr-pl+1)%mod)%mod*inv2%mod*(-p[i].first))%mod;
	}
	printf("%d",(ans+mod)%mod);
}