#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
const int N=1e6+10,mod=998244353;
ll n,k,a[N],sum,w=166374059; 
void solve(ll x)
{
	ll y=k;
	ll w1=y*(((6*x*x)%mod+(6*x*y)%mod+(6*x)%mod+(2*y*y)%mod+(3*y)%mod+1)%mod)%mod;
	sum+=(w1*w)%mod;
}
void solve1(ll x)
{
	if(k<x*-2)
	{
		x=((x+1)*(x+1))%mod;
		sum+=k*x;
		return;
	}
	sum=(sum+((x*-2)%mod-1)*(((x+1)*(x+1))%mod)%mod)%mod;
	ll y=(k-(x*-2))+1;
	x=-x-1;
	ll w1=y*(((6*x*x)%mod+(6*x*y)%mod+(6*x)%mod+(2*y*y)%mod+(3*y)%mod+1)%mod)%mod;
	sum+=(w1*w)%mod;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		if(a[i]>=0) solve(a[i]);
		else solve1(a[i]);	
	}
	cout<<sum%mod<<endl;
	return 0;
}