线段树写的 除了后面T掉的，前面有几个wa掉，显示我的答案是负的，应该是哪里爆了

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define ll long long
const int N=1e6+10,P=998244353;

int n,k;
ll a[N];
ll q[N];
struct T{
	ll l,r;
	ll f,s,c;
	void color(int x)
	{
		f=(f+2*x%P*s%P+(r-l+1)*x%P*x%P)%P;
		s=(s+(r-l+1)*x%P)%P;
		c=(c+x)%P;
	}
}t[N*4];

void pushup(T &u,T ls,T rs)
{
	u.s=(ls.s+rs.s)%P;
	u.f=(ls.f+rs.f)%P;
}
void pushdown(int u)
{
	if(t[u].c)
	{
		t[u<<1].color(t[u].c);
		t[u<<1|1].color(t[u].c);
		t[u].c=0;
	}
}

void build(int u,int l,int r)
{
	t[u]={l,r};
	if(l==r)
	{
		t[u]={l,r,a[l]*a[l]%P,a[l],0};
		return ;
	}
	int mid=l+r>>1;
	build(u<<1,l,mid);build(u<<1|1,mid+1,r);
	pushup(t[u],t[u<<1],t[u<<1|1]);
}
void change(int u,int l,int r,int x)
{
	int L=t[u].l,R=t[u].r;
	if(L>=l&&R<=r)
	{
		t[u].color(x);
//		cout<<"  "<<x<<" "<<L<<" "<<R<<" "<<t[u].f<<" "<<t[u].s<<endl;
		return ;
	}
	pushdown(u);
	int mid=L+R>>1;
	if(l<=mid) change(u<<1,l,r,x);
	if(r>mid) change(u<<1|1,l,r,x);
	pushup(t[u],t[u<<1],t[u<<1|1]);
//	cout<<"  "<<x<<" "<<L<<" "<<R<<" "<<t[u].f<<" "<<t[u].s<<endl;
}
T query(int u,int l,int r)
{
	int L=t[u].l,R=t[u].r;
	if(L>=l&&R<=r) return t[u];
	int mid=L+R>>1;
	pushdown(u);
	if(r<=mid ) return query(u<<1,l,r);
	if(l>mid) return query(u<<1|1,l,r);
	T ans,ls,rs;
	ls=query(u<<1,l,r);rs=query(u<<1|1,l,r);
	pushup(ans,ls,rs);
	return ans;
}

signed main()
{
	scanf("%lld%lld",&n,&k);
	int last=0;
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
		if(a[i]<0) last=i;
	}
	build(1,1,n);
	ll ans=0;
	for(int i=1;i<=k;i++)
	{
		double x=fabs((a[last]+1.0)/(a[last]+i));
		double y=fabs((a[last]+i)/(a[last]+1.0));
		while(x<y&&last)
		{
			last--;
			//cout<<i<<" "<<x<<" "<<y<<endl;
			x=fabs((a[last]+1.0)/(a[last]+i));
			y=fabs((a[last]+i)/(a[last]+1.0));
		}
		
		if(last) change(1,1,last,1);
		change(1,last+1,n,i);
		q[i]=query(1,1,n).f%P;
	//	cout<<i<<" "<<q[i]<<endl;
		if(last) change(1,1,last,-1);
		change(1,last+1,n,-i);
		ans=(ans+q[i])%P;
		
	}
	cout<<ans;
	return 0;
}